Properties of the Number 16320

Sixteen Thousand Three Hundred Twenty

Basics

Value: 16319 → 16320 → 16321

Parity: even

Prime: No

Previous Prime: 16319

Next Prime: 16333

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ⁶ × 3 × 5 × 17

Divisors: 1, 2, 3, 4, 5, 6, 8, 10, 12, 15

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111111000000

Octal: 37700

Duodecimal: 9540

Hexadecimal: 3fc0

Square: 266342400

Square Root: 127.74975538137049

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

a(n) = n²*(n² - 1)/4. A6011

Table T(n,k) by antidiagonals. T(n,k) is the number of length n primitive (=aperiodic or period n) k-ary words (n,k >= 1) which are earlier in lexicographic order than any other word derived by cyclic shifts of the alphabet. A143325

a(n) = (1/4)*floor(n/2)*floor((n-1)/2)*floor((n-2)/2)*floor((n-3)/2). A28723

a(n) = denominator of Bernoulli(2n)/(2n). A6953

Eisenstein series E₁₆(q) (alternate convention E₈(q)), multiplied by 3617. A29829

Denominator of B_2n/(-4n), where B_m are the Bernoulli numbers. A6863

Triangle T(n, k) = T(n-1, k) + T(n-1, k-1) + (j+1)*prime(j)*T(n-2, k-1) with j=4, read by rows. A153649

Write cosec x = 1/x + Sum e_n x^2n-1/(2n-1)!; sequence gives denominators of e_n. A36283

a(n) = a(n-1) + a(m) for n >= 4, where m = 2·n - 2 - 2^p+1 and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = a(3) = 1. A50027

Number of ways of writing n as a sum of 10 squares. A144