Properties of the Number 32000

Thirty-Two Thousand

Basics

Value: 31999 → 32000 → 32001

Parity: even

Prime: No

Previous Prime: 31991

Next Prime: 32003

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 ⁸ × 5 ³

Divisors: 1, 2, 4, 5, 8, 10, 16, 20, 25, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111110100000000

Octal: 76400

Duodecimal: 16628

Hexadecimal: 7d00

Square: 1024000000

Square Root: 178.88543819998318

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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

a(n) = period of the sequence {b(m), m>=0}, defined by b(m):=binomial(m+n,n) mod n. A133900

a(n) is the maximal number of a's that can be produced in a blank document with n "keystrokes". A193286

Numbers whose prime factors are 2 and 5. A33846

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 1 as ∑_k=0..n T(n,k)*binomial(n,k). A244116

Triangle read by rows: coefficients T(n,k) of a binomial decomposition of 1 as ∑_k=0..n T(n,k)*binomial(n,k). A244118

a(n) = (1/2)*(n³ + n*(n mod 2)). A317614

Numbers of form 2ⁱ*10^j, with i, j >= 0. A25612

a(n) = 4·n³. A33430

T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 1,0 or 1,2. A264272

a(n) = ∏_i=0..6 floor((n+i)/7). A9641