Properties of the Number 14559

Fourteen Thousand Five Hundred Fifty-Nine

Basics

Value: 14558 → 14559 → 14560

Parity: odd

Prime: No

Previous Prime: 14557

Next Prime: 14561

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 23 × 211

Divisors: 1, 3, 23, 69, 211, 633, 4853, 14559

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11100011011111

Octal: 34337

Duodecimal: 8513

Hexadecimal: 38df

Square: 211964481

Square Root: 120.66068125118473

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

Number of partitions of n where the difference between consecutive parts is at most 4. A238864

Expansion of (1-2x²)/((1-2x)(1+x)²). A113954

a(n) = (1/9)(2ⁿ⁺³-(-1)ⁿ(3n-1)). A103196

Position of first occurrence of 2ⁿ in A057923. A57925

Position at which 2ⁿ occurs in A057926, or -1 if it does not occur. A57928

Number of (w,x,y,z) with all terms in {1,...,n} and 2w+2x=3y+3z. A212567

a(n) is the smallest number whose greedy representation as a sum of terms of A126684 uses n terms. A302757

a(n) is the first positive number that has exactly n anagrams which have 3 prime divisors, counted by multiplicity, or 0 if there is no such number. A369184

a(1) = 1, a(2n) = smallest composite number > (2n-1)-th partial sum of the sequence itself and a(2n+1) = smallest prime > 2n-th partial sum of the sequence. A76975

Number of interior balls in a truncated octahedral arrangement. A93033