Properties of the Number 29064

Twenty-Nine Thousand Sixty-Four

Basics

Value: 29063 → 29064 → 29065

Parity: even

Prime: No

Previous Prime: 29063

Next Prime: 29077

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 ³ × 3 × 7 × 173

Divisors: 1, 2, 3, 4, 6, 7, 8, 12, 14, 21

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000110001000

Octal: 70610

Duodecimal: 149A0

Hexadecimal: 7188

Square: 844716096

Square Root: 170.48167056900868

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) = 7·6*5·4*3·2*1 + 14·13·12·11·10·9*8 + ... + (up to the n-th term). A319871

a(n) = ∑_k=1..n J₄(k)/240. A115003

Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n) + 1, where a(0) = 3, a(1) = 4, b(0) = 1, b(1) = 2, b(2) = 5, and (a(n)) and (b(n)) are increasing complementary sequences. A295955

Numbers k such that σ(k)+1 is a square and sets a new record for such squares. A63729

a(n) = (n+6)*(n+1)*(n² + 7·n + 16)/4. A168538

Number of (n+2) X (1+2) 0..1 arrays with each 3 X 3 subblock having clockwise perimeter pattern 00000000 00000001 or 00010101. A260468

a(n) = (prime(n)+1) * prime(n+1). A345727

Triangular array read by rows. T(n,k) is the number of functional digraphs on {1,2,...,n} such that no node is at a distance greater than one from a cycle and there are k recurrent elements whose preimage contains only one element, n>=0, 0<=k<=n. A220222

Expansion of 1/((1-x)*(1-x⁴)*(1-x⁵)*(1-x⁷)). A29064