Properties of the Number 10512

Ten Thousand Five Hundred Twelve

Basics

Value: 10511 → 10512 → 10513

Parity: even

Prime: No

Previous Prime: 10501

Next Prime: 10513

Digit Sum: 9

Digital Root: 9

Palindrome: No

Factorization: 2 ⁴ × 3 ² × 73

Divisors: 1, 2, 3, 4, 6, 8, 9, 12, 16, 18

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 10100100010000

Octal: 24420

Duodecimal: 6100

Hexadecimal: 2910

Square: 110502144

Square Root: 102.52804494381037

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) = 4·n*(2·n + 1). A33586

3 times 9-gonal (or nonagonal) numbers: a(n) = 3·n*(7·n-5)/2. A152759

Numbers k > 1 such that, in base 4, k and k² contain the same digits in the same proportion. A61658

Numbers k > 1 such that, in base 5, k and k² contain the same digits in the same proportion. A61659

T(n,k)=Number of nXk 0..2 arrays with no element equal to more than one of its horizontal, diagonal or antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A281653

Star of David matchstick numbers: a(n) = 6·n*(3·n+1). A45946

G.f. satisfies: A(x) = (1 - 2·x*A(x))² * (3·A(x) - 2). A231615

Numbers k with exactly three distinct prime factors and such that cototient(k) is a square. A306670

In the "3x+1" problem, let 0 denote a halving step and 1 denote an x->3x+1 step. Then a(n) is obtained by writing the sequence of steps needed to reach 1 from 2n+1 and reading it as a decimal number. A125710

Number of move operations required to sort all permutations of [n] by insertion sort. A212395