Properties of the Number 15008

Fifteen Thousand Eight

Basics

Value: 15007 → 15008 → 15009

Parity: even

Prime: No

Previous Prime: 14983

Next Prime: 15013

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 ⁵ × 7 × 67

Divisors: 1, 2, 4, 7, 8, 14, 16, 28, 32, 56

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11101010100000

Octal: 35240

Duodecimal: 8828

Hexadecimal: 3aa0

Square: 225240064

Square Root: 122.50714264890844

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

T(n,k) is the number of (n+1) X (k+1) 0..5 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings). A234658

a(n) is the number of numbers removed in each step of Eratosthenes's sieve for 10!. A145537

Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2x+2x²)ⁿ. A84606

Number of ways to write n as an ordered sum of eight powers of 2. A342251

Number of subsets of {2..n} such that it is not possible to choose a different binary index of each element. A370643

a(n) = 4·n*(21·n - 26). A263229

Triangle read by rows: T(0,0)=1; T(n,k) = 2·T(n-1,k)-2·T(n-1,k-1)+T(n-1,k-2), for k = 0, 1, ..., 2·n; T(n,k)=0 for n or k < 0. A304209

Number of subsets of {2..n} containing the product of any set of distinct elements whose product is <= n. A308542

Number of bicolored acyclic graphs on n unlabeled nodes. A329053

Number of partitions of n such that 5*(smallest part) = (number of parts). A350897