Properties of the Number 5320

Five Thousand Three Hundred Twenty

Basics

Value: 5319 → 5320 → 5321

Parity: even

Prime: No

Previous Prime: 5309

Next Prime: 5323

Digit Sum: 10

Digital Root: 1

Palindrome: No

Factorization: 2 ³ × 5 × 7 × 19

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 1010011001000

Octal: 12310

Duodecimal: 30B4

Hexadecimal: 14c8

Square: 28302400

Square Root: 72.93833011524188

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

Triangle read by rows: T(n,k) = number of labeled graphs on n nodes with k connected components, 1<=k<=n. A143543

a(n) = n*(n-1)*(n-2)*(n+3)/12. A117662

Numbers k such that A102489(k) is divisible by k. A32563

Number T(n,k) of permutations p of [n] such that k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A324563

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

Triangle read by rows: T(m,n) = number of Hamiltonian cycles on m X n grid of points (m >= 2, 2 <= n <= m). A321172

Expansion of e.g.f. (1-9·x)^-1/9, 9-factorial numbers. A45756

16-gonal (or hexadecagonal) numbers: a(n) = n*(7·n-6). A51868

Number T(n,k) of permutations p of [n] such that n-k is the maximum of 0 and the number of elements in any integer interval [p(i)..i+n*[i<p(i)]]; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A324564

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