Properties of the Number 29159

Twenty-Nine Thousand One Hundred Fifty-Nine

Basics

Value: 29158 → 29159 → 29160

Parity: odd

Prime: No

Previous Prime: 29153

Next Prime: 29167

Digit Sum: 26

Digital Root: 8

Palindrome: No

Factorization: 13 × 2243

Divisors: 1, 13, 2243, 29159

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000111100111

Octal: 70747

Duodecimal: 14A5B

Hexadecimal: 71e7

Square: 850247281

Square Root: 170.76006558911834

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 (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8. A252352

a(n) = 2·a(n-1) - 3·a(n-2) + 2·a(n-3) with a(0) = 1, a(1) = 5, a(2) = 6. A105577

a(n) = 40·n² - 1. A158598

a(n) = Fibonacci(p) mod p², where p = prime(n). A236395

Number of partitions of n into two sorts of parts having exactly 5 parts of the second sort. A258475

Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8. A252346

Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 5 6 or 8 and every 3X3 diagonal and antidiagonal sum equal to 0 3 5 6 or 8. A252350

Numbers n such that 151·2ⁿ-1 is prime. A50617

Counterexamples to the conjecture that an even, prime-indexed triangular plus 1 equals a prime or that an odd, prime-indexed triangular minus 2 equals a prime. A97785

Number of walks within N³ (the first octant of Z³) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 0, 0), (0, 0, -1), (0, 1, 1), (1, 0, 1)}. A150466