Properties of the Number 10717

Ten Thousand Seven Hundred Seventeen

Basics

Value: 10716 → 10717 → 10718

Parity: odd

Prime: No

Previous Prime: 10711

Next Prime: 10723

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 7 × 1531

Divisors: 1, 7, 1531, 10717

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100111011101

Octal: 24735

Duodecimal: 6251

Hexadecimal: 29dd

Square: 114854089

Square Root: 103.52294431670691

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

Perrin sequence (or Perrin numbers, or Ondrej Such sequence): a(n) = a(n-2) + a(n-3) with a(0) = 3, a(1) = 0, a(2) = 2. A1608

Magic constants of 5 X 5 magic squares which consist of consecutive primes. A176571

Smallest semiprime (A001358) which is at the end of an arithmetic progression of n semiprimes. A96003

Let A(n) = #{(i,j): i² + j² <= n}, V(n) = π*n, P(n) = A(n) - V(n); A000099 gives values of n where |P(n)| sets a new record; sequence gives A(A000099(n)). A323

Least number that ends an arithmetic progression of n numbers with the same prime signature. A87309

Riordan array (s(x),x·S(x)) where s(x) is the g.f. of the little Schroeder numbers A001003, and S(x) is the g.f. of the large Schroeder numbers A006318. A186826

Number of partitions of n such that (greatest part) + (least part) = number of parts. A237869

Number of minimal total dominating sets in the n-cycle graph. A300738

Super-Catalan triangle (read by rows) = triangular array associated with little Schroeder numbers (read by rows): T(0,0)=1, T(p,q) = T(p,q-1) if 0 < p = q, T(p,q) = T(p,q-1) + T(p-1,q) + T(p-1,q-1) if -1 < p < q and T(p,q) = 0 otherwise. A144944

Underline the central digit of all terms: the underlined digits reconstruct the starting sequence. This is also true if one translates the sequence in French and underlines the central letter of each word: the underlined letters spell the (French) sequence again. This is the lexicographically earliest sequence where repeated terms are admitted. A319718