Properties of the Number 29100

Twenty-Nine Thousand One Hundred

Basics

Value: 29099 → 29100 → 29101

Parity: even

Prime: No

Previous Prime: 29077

Next Prime: 29101

Digit Sum: 12

Digital Root: 3

Palindrome: No

Factorization: 2 ² × 3 × 5 ² × 97

Divisors: 1, 2, 3, 4, 5, 6, 10, 12, 15, 20

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111000110101100

Octal: 70654

Duodecimal: 14A10

Hexadecimal: 71ac

Square: 846810000

Square Root: 170.5872210923198

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) = Number of length n+3 0..k arrays with no four consecutive terms having the sum of any three elements equal to three times the fourth. A249290

T(n,k)=Half the number of nXk binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies. A183253

a(n) = n*(n+1)*(4·n+1)/2. A135713

Structured triakis icosahedral numbers (vertex structure 4). A100172

p-INVERT of (0,1,0,1,0,1,...), where p(S) = 1 - 3 S + 2 S³. A291251

Gaps between first elements of prime quintuples of the form (p, p+2, p+6, p+12, p+14). The quintuples are abutting: twin/cousin/sexy/twin pairs. A342502

Least number beginning with n such that every partial sum is a square. A95158

Half the number of nX4 binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies. A183250

Half the number of n X 5 binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies. A183251

Half the number of nX(n+1) binary arrays with the number of 1-1 adjacencies equal to the number of 0-0 adjacencies. A183254