Properties of the Number 14584

Fourteen Thousand Five Hundred Eighty-Four

Basics

Value: 14583 → 14584 → 14585

Parity: even

Prime: No

Previous Prime: 14563

Next Prime: 14591

Digit Sum: 22

Digital Root: 4

Palindrome: No

Factorization: 2 ³ × 1823

Divisors: 1, 2, 4, 8, 1823, 3646, 7292, 14584

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100011111000

Octal: 34370

Duodecimal: 8534

Hexadecimal: 38f8

Square: 212693056

Square Root: 120.76423311560423

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

Expansion of r(q⁴) / r(q)⁴ in powers of q where r() is the Rogers-Ramanujan continued fraction. A285584

Expansion of r(q)⁴ / r(q⁴) in powers of q where r() is the Rogers-Ramanujan continued fraction. A285629

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 145", based on the 5-celled von Neumann neighborhood. A279151

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 569", based on the 5-celled von Neumann neighborhood. A283068

Number of cubefree self avoiding walks in 2 dimensions of length n. A38592

Numbers n such that gcd(n, φ(n)) = gcd(φ(n), σ(n)) = gcd(σ(n), n) = τ(n). A217301

Molien series for complete weight enumerator of self-dual code over GF(5). A28344

a(n) = prime(n) + n³ + n² + 4n - 1. A60822

a(n) = 3·C(n)-2, where C(n) = A000108(n). A171556

Number of 2 X 2 matrices with all elements in {0,1,...,n} and determinant in {-1,0,1}. A209993