Properties of the Number -29752

Twenty-Nine Thousand Seven Hundred Fifty-Two

Basics

Value: -29753 → -29752 → -29751

Parity: even

Prime: No

Previous Prime:

Next Prime: 1

Digit Sum: 25

Digital Root: 7

Palindrome: No

Factorization: 2 ³ × 3719

Divisors: 1, 2, 4, 8, 3719, 7438, 14876, 29752

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

9108 Try Today's Challenge

Representations

Binary: -111010000111000

Octal: -72070

Duodecimal: -15274

Hexadecimal: -7438

Square: 885181504

Square Root: 172.4876807195227

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 incongruental unlabeled undirected trees with n nodes on a square lattice and edges of length 1 or sqrt(2) admitted to the 4 nearest or 4 2nd nearest neighbors. A56787

Powers of e^1/e rounded up. A107586

G.f. A(x) satisfies: A(x)³ = A( x³/(1-6·x) ), with A(0) = 0. A264229

Poincaré series [or Poincare series] for depths of roots in a certain root system. A19526

Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 809", based on the 5-celled von Neumann neighborhood. A273612

Number of permutations f of {1,...,n} such that prime(k)*prime(f(k)) - 2 is prime for every k = 1,...,n. A321855

Number of 1..31 integer arrays v[1..n] of length n with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..n-1. A171305

Number of 1..n integer arrays v[1..3] of length 3 with all autocorrelation values sum(i){v[i]*v[i-k]} distinct for k in 0..2. A171340