Properties of the Number 29057

Twenty-Nine Thousand Fifty-Seven

Basics

Value: 29056 → 29057 → 29058

Parity: odd

Prime: No

Previous Prime: 29033

Next Prime: 29059

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 7 ² × 593

Divisors: 1, 7, 49, 593, 4151, 29057

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000110000001

Octal: 70601

Duodecimal: 14995

Hexadecimal: 7181

Square: 844309249

Square Root: 170.46113926640288

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

Number of asymmetric orthoplex n-ominoes with cell centers determining n-3 space. A355051

a(1) = 2; thereafter, if a(n-1) is prime then a(n) = prime(n) + 1; otherwise a(n) = 2·a(n-1) - 1. A373801

McKay-Thompson series of class 30d for Monster. A58625

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, 1, 0), (1, 0, -1), (1, 0, 0), (1, 0, 1)}. A150370

Number of nX4 0..1 arrays with every element equal to 1, 2, 3, 4, 5, 7 or 8 king-move adjacent elements, with upper left element zero. A299933

Primes p such that for all initial conditions (x(0),x(1),x(2),x(3),x(4)) in [0..p-1]⁵ except [0,0,0,0,0], the 5-step recurrence x(k) = x(k-1) + x(k-2) + x(k-3) + x(k-4) + x(k-5) (mod p) has the same period, but x⁵ - x⁴ - x³ - x² - x - 1 is reducible (mod p). A371569

Expansion of 1/((1-x)*(1-x³)*(1-x⁸)*(1-x¹²)). A29057