Properties of the Number 17006

Seventeen Thousand Six

Basics

Value: 17005 → 17006 → 17007

Parity: even

Prime: No

Previous Prime: 16993

Next Prime: 17011

Digit Sum: 14

Digital Root: 5

Palindrome: No

Factorization: 2 × 11 × 773

Divisors: 1, 2, 11, 22, 773, 1546, 8503, 17006

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 100001001101110

Octal: 41156

Duodecimal: 9A12

Hexadecimal: 426e

Square: 289204036

Square Root: 130.40705502387516

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

a(n)-th and (a(n)+1)-st primes are the first pair of primes that differ by exactly 2n; a(n) = -1 if no such pair of primes exists. A38664

a(n) = number of m such that A080737(m) <= 2n. A80740

a(n) = p(n)*p(n+2) - 3·p(n+1), where p(n) is the n-th prime. A152528

Numbers n such that n¹⁰²⁴ + (n+1)¹⁰²⁴ is prime. A274234

a(n) is the least integer k such that 1/(∑_j=1..n 1/φ(k·j)) is an integer. A341810

a(n) is the least k such that the number of integers between (1/5)*prime(k) and (1/5)*prime(k+1) is n. A390786

a(n) = A051707(A025487). A108460

The n-th number m such that a nontrivial prime(n)-th root of unity modulo m exists. A305828

a(n) = s(n,n) + s(n,n-1) + s(n,n-2), where s(n,k) are the unsigned Stirling numbers of the first kind (see A132393). A308305

a(n) is the least k such that the number of integers between (1/4)*prime(k) and (1/4)*prime(k+1) is n. A390785