Properties of the Number 29737

Twenty-Nine Thousand Seven Hundred Thirty-Seven

Basics

Value: 29736 → 29737 → 29738

Parity: odd

Prime: No

Previous Prime: 29723

Next Prime: 29741

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 131 × 227

Divisors: 1, 131, 227, 29737

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010000101001

Octal: 72051

Duodecimal: 15261

Hexadecimal: 7429

Square: 884289169

Square Root: 172.4441938715247

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

Numbers k such that σ(k) = σ(k+10). A15880

T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock ne-sw antidiagonal difference nondecreasing horizontally and nw+se diagonal sum nondecreasing vertically. A253749

a(n) = ∑_k=0..n binomial(4·n+k+1,n-k). A390333

Consider the Diophantine equation x³ + y³ = z³ - 1 (0 < x < y < z) or 'Fermat near misses'. Arrange solutions by increasing values of z. Sequence gives values of z. A50787

A skew generalized Pascal triangle. A112906

Integer c such that (a³ + b³ - c³)² = 1 where a,b,c are integers greater than 2. A281224

Array read by antidiagonals: T(n,k) = number of possible positions in standard Connect Four play on a board of height n and width k (n>=1, k>=1). A235610

G.f. = b(2)²*b(6)/(x⁷+x⁶-x⁵-x²-x+1), where b(k) = (1-x^k)/(1-x). A266335

T(n,n-5), array T as in A038792. A38795

Number of composite numbers between 2ⁿ and 2ⁿ⁺¹. A182095