Properties of the Number 10056

Ten Thousand Fifty-Six

Basics

Value: 10055 → 10056 → 10057

Parity: even

Prime: No

Previous Prime: 10039

Next Prime: 10061

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 419

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 419, 838

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10011101001000

Octal: 23510

Duodecimal: 59A0

Hexadecimal: 2748

Square: 101123136

Square Root: 100.2796090937734

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

G.f.: ∏_{n >= 0} (1+x²ⁿ⁺¹)/(1-x²ⁿ⁺¹). A80054

Number of subsets of {1..n} containing n such that it is possible to choose a different prime factor of each element (choosable). A370586

Coefficients in the expansion ∏_n>=1 (1-q^2n-1)²/(1-q²ⁿ)². A274621

Number of 2n-bead balanced binary strings, rotationally equivalent to reversed complement. A45655

E.g.f.: A(x) = exp( ∑_n>=1 n(n+1)/2·a(n-1)*xⁿ/n! ) = ∑_n>=0 a(n)*xⁿ/n! with a(0)=1. A156325

Smallest base b > 1 such that both prime(n) and prime(n+1) are base-b Wieferich primes, i.e., p = prime(n) satisfies b^p-1 == 1 (mod p²) and q = prime(n+1) satisfies b^q-1 == 1 (mod q²). A259075

a(n+1) -+ a(n) = prime, a(n+1)*a(n) = average of twin prime pairs, a(1)=1, a(2)=6. A154494

T(n,k) = Number of n X k 0..1 arrays with the number of 1's king-move adjacent to some 0 two less than the number of 0's adjacent to some 1. A286216

Number of subsets of {2..n} containing all of their integer quotients > 1. A326078

Integers i > 1 for which there is no prime p such that i is a solution mod p of x⁴ = 2. A65903