Properties of the Number 11126

Eleven Thousand One Hundred Twenty-Six

Basics

Value: 11125 → 11126 → 11127

Parity: even

Prime: No

Previous Prime: 11119

Next Prime: 11131

Digit Sum: 11

Digital Root: 2

Palindrome: No

Factorization: 2 × 5563

Divisors: 1, 2, 5563, 11126

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

8509 Try Today's Challenge

Representations

Binary: 10101101110110

Octal: 25566

Duodecimal: 6532

Hexadecimal: 2b76

Square: 123787876

Square Root: 105.47985589675405

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

Coefficients in expansion of ∑_{n >= 1} xⁿ/(1-xⁿ)⁴. A59358

Lexicographically earliest increasing sequence which lists the positions of the zero digits in the sequence. A167519

Number of separate orbits/cycles to which the Catalan bijection A057508 partitions each A000108(n) structures encoded in the range [A014137(n-1)..A014138(n-1)] of the sequence A014486/A063171. A73193

a(n) = (9·n² - 5·n + 2)/2. A140064

O.g.f.: exp( ∑_n>=1 -(σ(2·n²) - σ(n²)) * (-x)ⁿ/n ). A215603

T(n,k)=Number of nXk 0,1 arrays indicating 2X2 subblocks of some larger (n+1)X(k+1) binary array having a sum of one, with rows and columns of the latter in lexicographically nondecreasing order. A227385

Highest point reached in trajectory of n described in A098282, or -1 if no cycle is ever reached. A145077

Expansion of ∑_k>=1 x^k/(1 + x^k)⁴. A320901

a(n) = ∑_d∣n (-1)^n/d-1 * binomial(d+2,3). A366813

a(n) is the numerator of (120·n² + 151·n + 47)/(512·n⁴ + 1024·n³ + 712·n² + 194·n + 15). A374580