Properties of the Number 39556

Thirty-Nine Thousand Five Hundred Fifty-Six

Basics

Value: 39555 → 39556 → 39557

Parity: even

Prime: No

Previous Prime: 39551

Next Prime: 39563

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 11 × 29 × 31

Divisors: 1, 2, 4, 11, 22, 29, 31, 44, 58, 62

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1001101010000100

Octal: 115204

Duodecimal: 1AA84

Hexadecimal: 9a84

Square: 1564677136

Square Root: 198.886902535084

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

Triangulations of the disk G_n,0. A2709

Square array T(n,m) (n>=0, m>=0) read by antidiagonals downwards giving number of rooted triangulations of type [n,m] up to orientation-preserving isomorphisms. A262586

Array read by antidiagonals: T(n,k) is the number of 3-connected triangulations of a disk up to orientation-preserving isomorphisms with n interior nodes and k nodes on the boundary, n >= 1, k >= 3. A341923

a(n) = floor(C(n+8,8)/C(n+2,2)). A84631

T(n,k)=Number of length n arrays x(i), i=1..n with x(i) in 0..i and no value appearing more than k times. A248842

a(n) = C(2n-1,n-1) mod n³. A99907

a(n) = ceiling(binomial(n,6)/n). A53643

a(n) = binomial(2·c-1, c-1) (mod c³), where c is the n-th composite. A244214

Number of permutations in the symmetric group S_n with order >= 3. A66052

Even composite integers m such that U(m)² == 1 (mod m) and V(m) == 3 (mod m), where U(m)=A001906(m) and V(m)=A005248(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=3 and b=1, respectively. A337777