Properties of the Number 11253

Eleven Thousand Two Hundred Fifty-Three

Basics

Value: 11252 → 11253 → 11254

Parity: odd

Prime: No

Previous Prime: 11251

Next Prime: 11257

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 11 ² × 31

Divisors: 1, 3, 11, 31, 33, 93, 121, 341, 363, 1023

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 10101111110101

Octal: 25765

Duodecimal: 6619

Hexadecimal: 2bf5

Square: 126630009

Square Root: 106.0801583709225

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: No

Perfect Number: No

Special

Kaprekar Constant: No

Munchausen Constant: No

Armstrong Number: No

Kaprekar Number: No

Catalan Number: No

Vampire Number: No

Taxicab Number: No

Super Prime: No

Friedman Number: No

Fermat Number: No

Cullen Number: No

OEIS Sequences

Apéry numbers: a(n) = ∑_k=0..n binomial(n,k)² * binomial(n+k,k). A5258

Square array, read by antidiagonals, where row n equals the crystal ball sequence for the A_n lattice. A108625

Number of labeled acyclic digraphs with n nodes containing exactly n-1 points of in-degree zero. A58877

Numbers that are palindromic in bases 2 and 7. A182234

3 times 10-gonal (or decagonal) numbers: a(n) = 3·n*(4·n-3). A152767

a(n) = ∑_{k=0..floor(n/2)} T(n-k,k), T given by A026758. A26768

This table shows the coefficients of combinatorial formulas needed for generating the sequential sums of p-th powers of binomial coefficients C(n,5). The p-th row (p>=1) contains a(i,p) for i=1 to 5·p-4, where a(i,p) satisfies ∑_i=1..n C(i+4,5)^p = 6·C(n+5,6) * ∑_i=1..5·p-4 a(i,p) * C(n-1,i-1)/(i+5). A87109

The number of vertices in a Farey diagram of order (n,n). A358883

Sum of divisors of twice square numbers. A65765

Square array read by ascending antidiagonals: T(n,k) = [x^k] 1/(1 - x) * Legendre_P(k, (1 + x)/(1 - x))ⁿ for n, k >= 0. A364113