Properties of the Number 29505

Twenty-Nine Thousand Five Hundred Five

Basics

Value: 29504 → 29505 → 29506

Parity: odd

Prime: No

Previous Prime: 29501

Next Prime: 29527

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 7 × 281

Divisors: 1, 3, 5, 7, 15, 21, 35, 105, 281, 843

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111001101000001

Octal: 71501

Duodecimal: 150A9

Hexadecimal: 7341

Square: 870545025

Square Root: 171.7701953192113

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

Triangle T(n, k, m) = (m*(n-k) + 1)*T(n-1, k-1, m) + (m·k + 1)*T(n-1, k, m) + m·k*(n-k)*T(n-2, k-1, m) with T(n, 0, m) = T(n, n, m) = 1 and m = 2, read by rows. A157148

Number A(n,k) of partitions of the (n+k)-multiset {0,...,0,1,2,...,k} with n 0's into distinct multisets; square array A(n,k), n>=0, k>=0, read by antidiagonals. A346520

Array read by descending antidiagonals: A(n,k) is the number of chiral pairs of colorings of the facets of a regular n-dimensional orthoplex using up to k colors. A325014

Starting index of a string of exactly 4 consecutive equal digits in decimal expansion of π. A49520

Number of chiral pairs of colorings of the 8 triangular faces of a regular octahedron or the 8 vertices of a cube using n or fewer colors. A337896

Starting index of a string of 4 or more consecutive equal digits in decimal expansion of π. A49516

Triangle read by rows: T(n,k) is the number of k-matchings of the corona K'(n) of the complete graph K(n) and the complete graph K(1); in other words, K'(n) is the graph constructed from K(n) by adding for each vertex v a new vertex v' and the edge vv'. A100862

Number of rooted trees with n nodes having some subtrees replaced by cycles such that no leaf nodes are left over. A213682

Number of partitions p of n such that exactly one number is in both p and its conjugate. A240675

Number of partitions of the (n+3)-multiset {0,0,0,1,2,...,n} into distinct multisets. A346813