Properties of the Number 15989

Fifteen Thousand Nine Hundred Eighty-Nine

Basics

Value: 15988 → 15989 → 15990

Parity: odd

Prime: No

Previous Prime: 15973

Next Prime: 15991

Digit Sum: 32

Digital Root: 5

Palindrome: No

Factorization: 59 × 271

Divisors: 1, 59, 271, 15989

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11111001110101

Octal: 37165

Duodecimal: 9305

Hexadecimal: 3e75

Square: 255648121

Square Root: 126.44761761298629

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 p of n such that the number of parts having multiplicity 1 is not a part and max(p) - min(p) is a part. A241448

Numerators of b(n) = (1/16ⁿ)*(4/(8·n+1) - 2/(8·n+4) - 1/(8·n+5) - 1/(8·n+6)). A48581

Expansion of g.f.: 1/((1 - x - x² + x⁶ - x⁸)*(1 - x² + x⁶ + x⁷ - x⁸)). A147620

a(n) is the numerator of (120·n² + 151·n + 47)/(512·n⁴ + 1024·n³ + 712·n² + 194·n + 15). A374580

Positions of the flipped bits (here they are always set from 0 to 1) in the sequence A059661. A59662

a(n) = ( (7 + 2·sqrt(2))ⁿ - (7 - 2·sqrt(2))ⁿ )/(4·sqrt(2)). A154347

a(n) = b_n(p_n+1) where p_n is the n-th prime, b_n(1)=1, b_n(2)=p_n, and for k>=3, b_n(k) is the smallest number larger than b_n(k-1) such that, for all i<k, b_n(k) is relatively prime to b_n(i) iff k is relatively prime to i. A173381

a(n) is the smallest integer not occurring earlier such that 2^a(1) + 2^a(2) + ... + 2^a(n) is a prime. A259630

Inverse of 1980th cyclotomic polynomial. A15989