Properties of the Number 10713

Ten Thousand Seven Hundred Thirteen

Basics

Value: 10712 → 10713 → 10714

Parity: odd

Prime: No

Previous Prime: 10711

Next Prime: 10723

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 3 × 3571

Divisors: 1, 3, 3571, 10713

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 10100111011001

Octal: 24731

Duodecimal: 6249

Hexadecimal: 29d9

Square: 114768369

Square Root: 103.50362312499017

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

Number of partitions of n having an integer median. A325347

a(n) = p² + p + 1 where p runs through the primes. A60800

a(n) = floor(n*φ¹⁷), where φ is the golden ratio, A001622. A4932

Fibonacci sequence beginning 3, 9. A22379

Sum of the divisors of the n-th odd square: a(n) = σ((2·n-1)²). A379223

Moduli a(n) = v(n) for the simple difference sets of Singer type of order m(n) (v(n), m(n)+1, 1) in the additive group modulo v(n) = m(n)² + m(n) + 1, with m(n) = A000961(n). A335865

Let T be the sequence Fibonacci(2n+1), n>=0 (cf. A001519); sequence lists the differences T(j)-T(i) for i<j. A169691

Numbers n such that Q(sqrt(n)) has class number 7. A218039

G.f.: ∑_n>=0 (n+1) * xⁿ * (1 + xⁿ)ⁿ. A326002

[s(k)-s(j)]/7, where the pairs (k,j) are given by A205862 and A205863, and s(k) denotes the (k+1)-st Fibonacci number. A205865