Properties of the Number 14592

Fourteen Thousand Five Hundred Ninety-Two

Basics

Value: 14591 → 14592 → 14593

Parity: even

Prime: No

Previous Prime: 14591

Next Prime: 14593

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ⁸ × 3 × 19

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 19, 24

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100100000000

Octal: 34400

Duodecimal: 8540

Hexadecimal: 3900

Square: 212926464

Square Root: 120.797350964332

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

Numbers that are divisible by exactly 10 primes with multiplicity. A46314

Numbers k such that 3^k + 26 is prime. A219044

Paradigm shift sequence for (4,5) production scheme with replacement. A246099

Composites whose prime factorization in base 5 is an anagram of the number in base 5. A260049

a(n) = a(n-1) + a(n-2) + a(n-3) - a(n-4); a(0)=0, a(1)=1, a(2)=1, a(3)=1. A116201

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every element next to itself plus and minus one within the range 0..2 horizontally or vertically. A232431

Triangle read by rows: T(n,k) (n>=0, 0<=k<=floor(n/2)) is the number of permutations of n and k valleys (considered cyclically). A263789

Let sigma_m (n) be result of applying sum-of-divisors function m times to n; call n (m,k)-perfect if sigma_m (n) = k·n; sequence gives the (3,k)-perfect numbers. A19292

Expansion of η(q)² / (η(q²) * η(q⁴)⁶) in powers of q. A134414

Numbers of the form p⁸*q·r where p, q, and r are distinct primes. A179747