Properties of the Number 29976

Twenty-Nine Thousand Nine Hundred Seventy-Six

Basics

Value: 29975 → 29976 → 29977

Parity: even

Prime: No

Previous Prime: 29959

Next Prime: 29983

Digit Sum: 33

Digital Root: 6

Palindrome: No

Factorization: 2 ³ × 3 × 1249

Divisors: 1, 2, 3, 4, 6, 8, 12, 24, 1249, 2498

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010100011000

Octal: 72430

Duodecimal: 15420

Hexadecimal: 7518

Square: 898560576

Square Root: 173.1357848626332

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

T(n,k) is the number of (n+1) X (k+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 8 (constant-stress 1 X 1 tilings). A234738

Expansion of 1/(g * (2-g)), where g = 1+x·g⁴ is the g.f. of A002293. A391209

Di-Boustrophedon transform of (1,0,0,0,...): Fill in an array by diagonals alternating in the 'up' and 'down' directions. The n-th diagonal starts with the n-th element of (1,0,0,0,...). When going in the 'up' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the row the new element is in. When going in the 'down' direction the next element is the sum of the previous element of the diagonal and the previous two elements of the column the new element is in. The final element of the n-th diagonal is a(n). A63179

Dirichlet self-convolution of the integer partition numbers A000041. A323764

Number of (n+1) X (1+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 8 (constant-stress 1 X 1 tilings). A234731

Number of (n+1) X (5+1) 0..7 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 8 (constant-stress 1 X 1 tilings). A234735

a(0) = 1; a(n) = -∑_k=1..n binomial(n,k) * k³ * a(n-k). A335578

Centered pentagonal numbers that are abundant. A382696

Triangle of coefficients of di-Boustrophedon transform (see A063179) read by rows: Let the original sequence be (U0,U1,...) and the transformed sequence (V0,V2,...), then Vn is a linear combination of U0,...,Un. T(n,m) is the coefficient that goes with Um to get Vn. A63415

σ(n) + n is a fourth power. A114071