Properties of the Number -13252

Thirteen Thousand Two Hundred Fifty-Two

Basics

Value: -13253 → -13252 → -13251

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 13

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 3313

Divisors: 1, 2, 4, 3313, 6626, 13252

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

5184 Try Today's Challenge

Representations

Binary: -11001111000100

Octal: -31704

Duodecimal: -7804

Hexadecimal: -33c4

Square: 175615504

Square Root: 115.11733144926528

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) = A002527(n+1) - A002527(n) - A002526(n). A2529

Number of partitions of n without three consecutive parts in arithmetic progression. A238424

Numbers that are the sum of seven fourth powers in five or more ways. A345571

Numbers that are the sum of seven fourth powers in exactly five ways. A345827

Powers of 2 written in base 6. A4645

Numbers k such that A057775(k) is the factor of a Fermat number 2^{2^m} + 1 for some m. A201364

Triangle read by rows: T(n,k) is the number of partitions of the set {1,2,...,n} having k adjacent blocks of size 2, i.e., blocks of the form (i,i+1) (0 <= k <= floor(n/2)). A184174

Numbers·such that x² = y³ + z (0 < abs(z) < y). A268510

a(1) = 1; for n > 1, a(n) = n·a(n-1) if n is a prime, otherwise a(n) = floor(a(n-1)/A020639(n)), where A020639(n) is the smallest prime divisor of n. A330252

Total number of parts >= 3 in all partitions of n. A207033