Properties of the Number 15120

Fifteen Thousand One Hundred Twenty

Basics

Value: 15119 → 15120 → 15121

Parity: even

Prime: No

Previous Prime: 15107

Next Prime: 15121

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ³ × 5 × 7

Divisors: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101100010000

Octal: 35420

Duodecimal: 8900

Hexadecimal: 3b10

Square: 228614400

Square Root: 122.96340919151518

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

Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record. A2182

Triangle of numbers T(n,k) = k!*Stirling2(n,k) read by rows (n >= 1, 1 <= k <= n). A19538

Triangle T(n,k) = n!/(n-k)! (0 <= k <= n) read by rows, giving number of permutations of n things k at a time. A8279

Triangle of Lah numbers. A8297

Superabundant [or super-abundant] numbers: n such that σ(n)/n > σ(m)/m for all m < n, σ(n) being A000203(n), the sum of the divisors of n. A4394

Triangle of numbers T(n,k) = k!*Stirling2(n,k) = A000142(k)*A048993(n,k) read by rows, T(n, k) for 0 <= k <= n. A131689

Coefficients of list partition transform: reciprocal of an exponential generating function (e.g.f.). A133314

Lah numbers: a(n) = (n-1)*n!/2. A1286

a(n) = (2·n+1)! / n!. A407

The minimal numbers: sequence A005179 arranged in increasing order. A7416