Properties of the Number 29596

Twenty-Nine Thousand Five Hundred Ninety-Six

Basics

Value: 29595 → 29596 → 29597

Parity: even

Prime: No

Previous Prime: 29587

Next Prime: 29599

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 ² × 7 ² × 151

Divisors: 1, 2, 4, 7, 14, 28, 49, 98, 151, 196

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001110011100

Octal: 71634

Duodecimal: 15164

Hexadecimal: 739c

Square: 875923216

Square Root: 172.0348801842231

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

Triangle read by rows giving coefficients of polynomials arising in successive differences of (n!)_{n>=0}. A94791

Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k). A116071

Triangle read by rows: matrix product of the Stirling numbers of the first kind with the binomial coefficients. A126353

Number of pairs (not necessarily successors) of partitions of n that are incomparable in dominance (natural, majorization) ordering. A248476

Triangle read by rows, T(n,k) = ∑_j=0..n C(-j,-n)*S1(j,k), S1 the Stirling cycle numbers A132393, for n>=0 and 0<=k<=n. A269954

Binary "cubes"; numbers whose binary representation consists of three consecutive identical blocks. A297405

Number of compositions of n with the multiplicity of the first part even. A331609

Expansion of e.g.f. -log(1-x)³ * exp(-x) / (6 * (1-x)). A381068

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

a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^p+1, starting with a(1) = a(2) = 1 and a(3) = 4. A49946