Properties of the Number 29055

Twenty-Nine Thousand Fifty-Five

Basics

Value: 29054 → 29055 → 29056

Parity: odd

Prime: No

Previous Prime: 29033

Next Prime: 29059

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 3 × 5 × 13 × 149

Divisors: 1, 3, 5, 13, 15, 39, 65, 149, 195, 447

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111000101111111

Octal: 70577

Duodecimal: 14993

Hexadecimal: 717f

Square: 844193025

Square Root: 170.45527272572122

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

T(n,k)=Number of nXk arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nXk array. A220010

Moebius transform of binomial(n+3, 4). A117109

Irregular triangle read by rows: T(n,k) is the k-th generalized Eulerian number of order n and degree 2, for n >= 1 (the rows start at k=1). A211232

Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 283", based on the 5-celled von Neumann neighborhood. A280530

Numbers m for which the sum of all values of k satisfying the equation: (m - floor((m - k)/k)) mod k = 0 (1 <= k <= m) equals 2·m. A380153

Number of partitions of n into parts not of the form 23k, 23k+11 or 23k-11. Also number of partitions with at most 10 parts of size 1 and differences between parts at distance 10 are greater than 1. A35999

a(n) = (2·n³ + 5·n² - 13·n)/2. A162262

Number of nX5 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 nX5 array. A220007

Number of 4 X n arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and nonincreasing columns, 0..3 4 X n array. A220013

Numbers k such that 2^k == 8 (mod k). A15922