Properties of the Number 14580

Fourteen Thousand Five Hundred Eighty

Basics

Value: 14579 → 14580 → 14581

Parity: even

Prime: No

Previous Prime: 14563

Next Prime: 14591

Digit Sum: 18

Digital Root: 9

Palindrome: No

Factorization: 2 ² × 3 ⁶ × 5

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

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 11100011110100

Octal: 34364

Duodecimal: 8530

Hexadecimal: 38f4

Square: 212576400

Square Root: 120.74767078498864

Classification

Fibonacci: No

Bell Number: No

Factorial Number: No

Regular Number: Yes

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: coefficients T(n,k) of a binomial decomposition of nⁿ as Sum(k=0..n)T(n,k)*binomial(n,k). A244122

Numbers which can be expressed as the product of a number and its reversal in at least two different ways. A66531

T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally, diagonally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order. A229534

Triangle whose (i,j)-th entry is binomial(i,j)*3^i-j*3^j. A38221

Irregular triangle read by rows: mean version of Girard-Waring formula A210258, for m = 3 data values. A287768

a(n) = 20·n². A195322

Record (maximal) gaps between prime 5-tuples (p, p+2, p+6, p+8, p+12). A201073

Sum of the largest parts of the partitions of n into 9 squarefree parts. A326532

Triangle whose (i,j)-th entry is binomial(i,j)*9^i-j*1^j. A38291

T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and vertically with exactly one mistake and colors introduced in row-major 0..2 order. A229460