Properties of the Number 53900

Fifty-Three Thousand Nine Hundred

Basics

Value: 53899 → 53900 → 53901

Parity: even

Prime: No

Previous Prime: 53899

Next Prime: 53917

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 5 ² × 7 ² × 11

Divisors: 1, 2, 4, 5, 7, 10, 11, 14, 20, 22

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1101001010001100

Octal: 151214

Duodecimal: 27238

Hexadecimal: d28c

Square: 2905210000

Square Root: 232.163735324878

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

Number of triangular regions in regular n-gon with all diagonals drawn. A62361

a(n) = 11·binomial(10·n + 11, n)/(10·n + 11). A229963

Exponential weird numbers: numbers that are exponential abundant (A129575) but not exponential pseudoperfect (A318100). A321146

a(n) = n³ + (n+1)³ + (n+2)³ + (n+3)³ + (n+4)³. A27604

a(n) = ∏_{d∣n, d<n} prime(A286622(d)-1). A305792

a(n) is the smallest nonnegative integer k where exactly n pairs of positive integers (x, y) exist such that x² + 19·y² = k. A374161

Coreful weird numbers: numbers k that are coreful abundant (A308053) but no subset of their aliquot coreful divisors sums to k. A339939

Minimal covering numbers. A160559

Let S(1)={1} and, for n>1 let S(n) be the smallest set containing x, x+1, 2x and 3x for each element·in S(n-1). a(n) is the number of elements in S(n). A123247

Numbers with prime factorization pq^2r^2s². A189344