Properties of the Number 51520

Fifty-One Thousand Five Hundred Twenty

Basics

Value: 51519 → 51520 → 51521

Parity: even

Prime: No

Previous Prime: 51517

Next Prime: 51521

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ⁶ × 5 × 7 × 23

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100100101000000

Octal: 144500

Duodecimal: 25994

Hexadecimal: c940

Square: 2654310400

Square Root: 226.98017534577772

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

Square table read by downward antidiagonals: n-th row has e.g.f. (1-9·x)^-n/9. A392037

Nonuple factorial, 9-factorial, n!9, n!!!!!!!!!. A114806

Sum of the prime parts in the partitions of n into 7 parts. A309468

Consider the e.g.f. C(x,y) = sqrt(1/2) * ∑_n>=0 ∑_k=0..2·n T(n,k) * x^2·n-k * y^k / ((2·n-k)!*k!) and related functions S(x,y) and D(x,y), as defined in the Formula section. Sequence gives the triangular array of coefficients T(n,k) (n>=0, 0<=k<=2·n) of C(x,y). A326801

Consider the e.g.f. D(x,y) = sqrt(1/2) * ∑_n>=0 ∑_k=0..2·n T(n,k) * x^2·n-k * y^k / ((2·n-k)!*k!) and related functions S(x,y) and C(x,y), as defined in the Formula section. Sequence gives the triangular array of coefficients T(n,k) (n>=0, 0<=k<=2·n) of D(x,y). A326802

Numbers with prime factorization pqrs⁶. A190292

8th-order Patalan numbers (generalization of Catalan numbers). A25753

a(n) = ∏_{k = 1..n-1} (9·k - 4). A147629

a(n) = 4*(4 + 9·n² + 15·n). A144449

Refactorable numbers k such that 2·k + 1 is also a refactorable number. A281294