Properties of the Number 15009

Fifteen Thousand Nine

Basics

Value: 15008 → 15009 → 15010

Parity: odd

Prime: No

Previous Prime: 14983

Next Prime: 15013

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 3 × 5003

Divisors: 1, 3, 5003, 15009

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101010100001

Octal: 35241

Duodecimal: 8829

Hexadecimal: 3aa1

Square: 225270081

Square Root: 122.51122397560152

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

Sum of GCD's of parts in all partitions of n. A78392

T(n,k) = Number of ways to reciprocally link elements of an n X k array either to themselves or to exactly two king-move neighbors. A220595

Solution (a(n)) of the complementary equation a(n) = 2·a(n-1) - a(n-2) + b(n-1) + b(n); see Comments. A305330

Expansion of 1 / ∑_k>=0 (-x)^{k*(3·k - 1}/2). A308806

L.g.f.: ∑_n>=1 (∑_d∣n d·x^d)ⁿ/n = ∑_n>=1 a(n)*xⁿ/n. A192859

a(n) = Sum{a(k): k=0,1,2,...,n-4,n-2,n-1}; a(n-3) is not a summand; initial terms are 0,1,4. A49860

Numerators of expansion of a function η(x) related to Cremer points. A58969

a(n) is the sum of all distinct integers that can be produced by reversing the digits of n in any base b >= 2. A211518

Equals two maps: number of nX2 binary arrays indicating the locations of corresponding elements equal to exactly two of their king-move neighbors in a random 0..1 nX2 array. A220243

Number of ways to reciprocally link elements of an n X 2 array either to themselves or to exactly two king-move neighbors. A220590