Properties of the Number 29638

Twenty-Nine Thousand Six Hundred Thirty-Eight

Basics

Value: 29637 → 29638 → 29639

Parity: even

Prime: No

Previous Prime: 29633

Next Prime: 29641

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 × 7 × 29 × 73

Divisors: 1, 2, 7, 14, 29, 58, 73, 146, 203, 406

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111001111000110

Octal: 71706

Duodecimal: 1519A

Hexadecimal: 73c6

Square: 878411044

Square Root: 172.15690517664402

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

10-gonal (or decagonal) pyramidal numbers: a(n) = n*(n + 1)*(8·n - 5)/6. A7585

Total number of parts smaller than the largest part, in all partitions of n. A116686

a(n) = Fibonacci(p) mod p², where p = prime(n). A236395

Number of nonempty subsets of {1, 2, ..., n} with <=8 pairwise coprime elements. A187269

Numbers whose binary expansion consists of alternating runs of 1's and 0's where each run of 0's is exactly one shorter than the preceding run of 1's, and the expansion ends with a 0-run. A387270

Number of -4..4 arrays x(0..n-1) of n elements with zero sum and no two consecutive declines, no adjacent equal elements, and no element more than one greater than the previous (random base sawtooth pattern). A200177

Even, nonzero decagonal pyramidal numbers. A218331

Number of n X 7 -1,1 arrays such that the sum over i=1..n, j=1..7 of i·x(i,j) is zero and rows are nondecreasing (ways to put 7 thrusters pointing east or west at each of n positions 1..n distance from the hinge of a south-pointing gate without turning the gate). A225308

Number of 7Xn -1,1 arrays such that the sum over i=1..7,j=1..n of i·x(i,j) is zero and rows are nondecreasing (ways to put n thrusters pointing east or west at each of 7 positions 1..n distance from the hinge of a south-pointing gate without turning the gate). A225314

Breadth-first traversal of a binary tree in which the value at the n-th node is equal to ParentNode()*prime(n-1). A268878