Properties of the Number 29625

Twenty-Nine Thousand Six Hundred Twenty-Five

Basics

Value: 29624 → 29625 → 29626

Parity: odd

Prime: No

Previous Prime: 29611

Next Prime: 29629

Digit Sum: 24

Digital Root: 6

Palindrome: No

Factorization: 3 × 5 ³ × 79

Divisors: 1, 3, 5, 15, 25, 75, 79, 125, 237, 375

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001110111001

Octal: 71671

Duodecimal: 15189

Hexadecimal: 73b9

Square: 877640625

Square Root: 172.11914478058506

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) = (7·n⁴ + 5·n²)/12. A185505

Decimal representation of the diagonal from the corner to the origin of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 41", based on the 5-celled von Neumann neighborhood. A285546

a(n) = 56·n² + 1. A158660

a(n) is the number of perfect matchings in the graph with vertices labeled 1 to 2n with edges {i,j} for 1<=|i-j|<=4. A320346

Rectangular array A read by upward antidiagonals: A(n,m) is the number of surjective difunctional (regular) binary relations between an n-element set and an m-element set. A265707

Numbers k such that if you multiply the primes that are indexed by the digits of k and add the sum of digits of k you get k. A123911

Rectangular array A read by upward antidiagonals: A(n,m) is the number of total difunctional (regular) binary relations between an n-element set and an m-element set. A265706

Expansion of e.g.f. A(x) satisfying A(x)² = exp(x) * A(x·A(x)) with A(0) = 1. A367391

Even numbers in (3,2)-Pascal triangle A029618 that are different from 2. A29625