Properties of the Number 12572

Twelve Thousand Five Hundred Seventy-Two

Basics

Value: 12571 → 12572 → 12573

Parity: even

Prime: No

Previous Prime: 12569

Next Prime: 12577

Digit Sum: 17

Digital Root: 8

Palindrome: No

Factorization: 2 ² × 7 × 449

Divisors: 1, 2, 4, 7, 14, 28, 449, 898, 1796, 3143

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 11000100011100

Octal: 30434

Duodecimal: 7338

Hexadecimal: 311c

Square: 158055184

Square Root: 112.12493032327824

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

Expansion of ∏_k>=1 (1 + x^2·k)^2·k/(1 + x^2·k-1)^2·k-1. A284474

a(n) = 16n² + n. A157474

a(n) = ∑_{k=1..floor(n/2)} T(n, 2k), array T as in A049777. A49779

a(n) = ∑_d∣n d^n/d * (n/d)^d. A359863

a(n) = (n+1)*(5·n²+4·n+1). A27849

a(n) = 64·n² + 2·n. A158070

a(n) = 784·n² + 28. A158659

Numbers m such that m and m+22 have the same sum of divisors. A172333

Convolved with its aerated variant of two zeros between terms = A000041. A174068

Those positive integers n where, when written in binary, there are exactly k number of runs (of either 0's or 1's) each of exactly k length, for all k where 1<=k<=m, for some positive integer m. A175356