Properties of the Number 29140

Twenty-Nine Thousand One Hundred Forty

Basics

Value: 29139 → 29140 → 29141

Parity: even

Prime: No

Previous Prime: 29137

Next Prime: 29147

Digit Sum: 16

Digital Root: 7

Palindrome: No

Factorization: 2 ² × 5 × 31 × 47

Divisors: 1, 2, 4, 5, 10, 20, 31, 47, 62, 94

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111000111010100

Octal: 70724

Duodecimal: 14A44

Hexadecimal: 71d4

Square: 849139600

Square Root: 170.70442290696514

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 integer partitions of n with a neighborless singleton. A356235

T(n,k)=Number of nXk 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279741

Number of necklaces with n beads of 5 colors, no 2 adjacent beads the same color. A106367

Number of nonisomorphic proper colorings of partition multicycle graph using five colors. A298265

Triangle read by rows: T(n,k) = round(c(n)/(c(k)*c(n-k))) where c are partial products of a sequence defined in comments. A172364

Number of magic labelings with magic sum n of 3rd graph shown in link. A244871

Number of nX5 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279738

Number of 5Xn 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279745

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), (-1, 0, 1), (-1, 1, 0), (0, -1, 1), (1, 1, 0)}. A149256

Number of n X n 0..1 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards. A279734