Properties of the Number 29027

Twenty-Nine Thousand Twenty-Seven

Basics

Value: 29026 → 29027 → 29028

Parity: odd

Prime: Yes

Previous Prime: 29023

Next Prime: 29033

Digit Sum: 20

Digital Root: 2

Palindrome: No

Factorization: 29027

Divisors: 1, 29027

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000101100011

Octal: 70543

Duodecimal: 1496B

Hexadecimal: 7163

Square: 842566729

Square Root: 170.37311994560645

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

a(n) is the first prime p such that the sum of 2·n consecutive primes starting at p is (q-1)*q where q is prime, or 0 if there is no such p. A338990

Next-to-smallest k such that 2^2ⁿ - k is prime. A58221

Larger prime in pair prime(k) +/- k for some k. A107637

Number of nX3 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2. A275223

Numbers k such that (35^k - 4^k)/31 is prime. A389768

T(n,k)=Number of nXk 0..2 arrays with no element equal to any value at offset (-2,-1) (-2,1) or (-1,0) and new values introduced in order 0..2. A275228

Number of nX6 0..1 arrays avoiding 0 0 1 horizontally and 0 1 1 vertically. A206783

Nonprime solutions m to Subbarao's congruence φ(m)*τ(m)+ 2 == 0 (mod m), where φ is Euler's totient (A000010) and τ is the number of divisors (A000005). A389878

Expansion of 1/((1-x)*(1-x²)*(1-x⁹)*(1-x¹⁰)). A29027