Properties of the Number 29188

Twenty-Nine Thousand One Hundred Eighty-Eight

Basics

Value: 29187 → 29188 → 29189

Parity: even

Prime: No

Previous Prime: 29179

Next Prime: 29191

Digit Sum: 28

Digital Root: 1

Palindrome: No

Factorization: 2 ² × 7297

Divisors: 1, 2, 4, 7297, 14594, 29188

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001000000100

Octal: 71004

Duodecimal: 14A84

Hexadecimal: 7204

Square: 851939344

Square Root: 170.84495895401773

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

Numbers equal to a permutation (or rearrangement) of the digits of the sum of their proper divisors. Rearrangements which cause leading zeros are excluded. A85844

Number of non-self-conjugate inseparable solutions of X + Y = 2Z (integer, disjoint triples from {1,2,3,...,3n}). A282617

Group the triangular numbers so that the n-th group sum is a multiple of n. 1, (3, 6, 10, 15), (21), (28), (36, 45, 55, 66, 78), (91, 105, 120, 136, 153, 171, 190), ... Sequence contains n-th group sum divided by n. A114032

0 together with numbers k such that 8·R_k - 7 is a prime, where R_k = 11...1 is the repunit (A002275) of length k. A99421

Triangle t(n,m) = 2·A008292(n+1,m+1) - A007318(n,m), a linear combination of Eulerian numbers and Pascal's triangle, 0 <= m <= n. A141690

A linear combination of A008292 and A130595: t(n,m)=2·A008292(n,m)- A130595(n,m). A141903

Number of nondecreasing sequences of n 1..n integers with every element dividing the sequence sum. A212531

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