Properties of the Number 29295

Twenty-Nine Thousand Two Hundred Ninety-Five

Basics

Value: 29294 → 29295 → 29296

Parity: odd

Prime: No

Previous Prime: 29287

Next Prime: 29297

Digit Sum: 27

Digital Root: 9

Palindrome: No

Factorization: 3 ³ × 5 × 7 × 31

Divisors: 1, 3, 5, 7, 9, 15, 21, 27, 31, 35

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001001101111

Octal: 71157

Duodecimal: 14B53

Hexadecimal: 726f

Square: 858197025

Square Root: 171.15782190715095

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

Odd infinitary abundant numbers. A127666

Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2·k, where bsigma is the sum of the bi-unitary divisors function (A188999). A293186

a(n) = n³ - n*(n+1)/2. A160378

Number of series-reduced free pure identity multifunctions (with empty expressions allowed) with one atom and n positions. A317881

Number of degree-n permutations with (mutually) relatively prime cycle lengths. A79128

Sum of the fifth largest parts in the partitions of n into 7 parts. A308929

Number T(n,k) of permutations of [n] such that k is the GCD of the cycle lengths; triangle T(n,k), n>=0, 0<=k<=n, read by rows. A346085

Number of permutations in the symmetric group S_n that have even order. A59838

a(n) is the number of permutations in the symmetric group S_n that contain an odd cycle. A87137

Triangle T(n, k) = c(n, q)/c(k, q) if k <= floor(n/2), otherwise c(n, q)/c(n-k, q), where c(n, q) = ∏_j=1..n (1 - q^j) and q = 2, read by rows. A174387