Properties of the Number -29252

Twenty-Nine Thousand Two Hundred Fifty-Two

Basics

Value: -29253 → -29252 → -29251

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 2 ² × 71 × 103

Divisors: 1, 2, 4, 71, 103, 142, 206, 284, 412, 7313

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

7925 Try Today's Challenge

Representations

Binary: -111001001000100

Octal: -71104

Duodecimal: -14B18

Hexadecimal: -7244

Square: 855679504

Square Root: 171.03216071838654

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 bracelet structures using a maximum of three different colored beads. A56353

Square array read by descending antidiagonals. T(n,k) is the number of ways to separate the columns of an ordered pair of n-permutations (that have been written as a 2 X n array, one atop the other) into k cells so that no cell has a column rise. For n >= 0, k >= 0. A340986

Number of partitions of n such that (greatest part) - (least part) >= number of parts. A237834

a(0) = 1; a(n) = ∑_k=1..n (-1)^k+1 * binomial(n,k)² * binomial(2·k,k) * a(n-k). A336271

Expansion of (1-x)/(1-x-x³-x⁴+x⁵). A52532

Triangle T(n,k) read by rows: number of simple connected graphs with n nodes and k endpoints, n >= 0, 0 <= k <= n. A304222

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, -1), (0, 0, 1), (0, 1, 0), (0, 1, 1), (1, 0, 1)}. A151243

Number of permutations of 1..n with all differences of elements separated by distances 1 through 4 being respectively unique. A170810