Properties of the Number 52512

Fifty-Two Thousand Five Hundred Twelve

Basics

Value: 52511 → 52512 → 52513

Parity: even

Prime: No

Previous Prime: 52511

Next Prime: 52517

Digit Sum: 15

Digital Root: 6

Palindrome: No

Factorization: 2 ⁵ × 3 × 547

Divisors: 1, 2, 3, 4, 6, 8, 12, 16, 24, 32

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 1100110100100000

Octal: 146440

Duodecimal: 26480

Hexadecimal: cd20

Square: 2757510144

Square Root: 229.15496939844007

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

T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 3 neighboring 1s. A297607

Each permutation in the list A060117 converted to Site Swap notation, with "zero throws" (fixed elements) replaced with n, the length of siteswap. A60495

Successively larger 3-ball indecomposable ground-state site swaps of A084511 in concatenated decimal notation. A84512

Triangle read by rows: T(n,k) is the number of permutations of n elements with transposition distance equal to k, n >= 1 and 0 <= k <= A065603(n). A164366

Number of nX4 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 3 neighboring 1s. A297603

Number of 5Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 0, 1 or 3 neighboring 1s. A297611

a(n) = (-1) * round(j((1 + sqrt(-n))/2)), where j is j-invariant. A302142

Number of rooted labeled trees of height at most 2. A52512