Properties of the Number 17008

Seventeen Thousand Eight

Basics

Value: 17007 → 17008 → 17009

Parity: even

Prime: No

Previous Prime: 16993

Next Prime: 17011

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ⁴ × 1063

Divisors: 1, 2, 4, 8, 16, 1063, 2126, 4252, 8504, 17008

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001001110000

Octal: 41160

Duodecimal: 9A14

Hexadecimal: 4270

Square: 289272064

Square Root: 130.41472309520884

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

Partial sums of A299283. A299284

Number T(n,k) of ordered pairs (p,q) of permutations of [n] with equal up-down signatures and p(1)=q(1)=k if n>0; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A262372

Square spiral of sums of selected preceding terms, starting at 1. A141481

T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 4 6 or 7. A252269

For even k >= 4, let f(k) = A066285(k/2) be the minimal difference between primes p and q whose sum is k. Such a k is in the sequence if f(k) > f(m) for all even m with 4 <= m < k. A65978

Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} having k maximal strings of increasing consecutive integers (0<=k<=floor(n/2)). A136123

Number of permutations of length n by rises. A1277

Triangle read by rows: number of permutations of length n that require exactly k removals from the beginning to become heapable. A390368

Irregular triangle read by rows: T(n,k) (n>=1, 0 <= k <= floor(n/2)) = number of permutations of 1..n with exactly floor(n/2) - k runs of consecutive pairs up. A10029

Number of permutations of {1,2,...,n} having exactly one string of consecutive fixed points (including singletons). A177265