Properties of the Number -53200

Fifty-Three Thousand Two Hundred

Basics

Value: -53201 → -53200 → -53199

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ⁴ × 5 ² × 7 × 19

Divisors: 1, 2, 4, 5, 7, 8, 10, 14, 16, 19

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -1100111111010000

Octal: -147720

Duodecimal: -26954

Hexadecimal: -cfd0

Square: 2830240000

Square Root: 230.65125189341592

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

Expansion of 1/((1+x)*(1-x)⁵). A1752

Lesser of amicable pair m < n defined by t(n) = m and t(m) = n where t(n) = ψ(n) - n and ψ(n) = A001615(n) is the Dedekind ψ function. A323329

a(n) = n²*(n² - 1)/3. A112742

25-gonal pyramidal numbers: a(n) = n*(n+1)*(23·n-20)/6. A256645

T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the sum of all four elements of every 2X2 subblock equal. A237015

Numbers that are the sum of four third powers in nine or more ways. A345146

Numbers that are the sum of four third powers in ten or more ways. A345155

Triangle read by rows where T(n,k) is the number of labeled simple graphs covering n vertices with exactly k endpoints (vertices of degree 1). A327377

Numbers that are the sum of four third powers in exactly ten ways. A345156

The Wiener index of the P₃ X P_n grid, where P_m is the path graph on m nodes. The Wiener index of a connected graph is the sum of distances between all unordered pairs of nodes in the graph. A180569