Properties of the Number 29776

Twenty-Nine Thousand Seven Hundred Seventy-Six

Basics

Value: 29775 → 29776 → 29777

Parity: even

Prime: No

Previous Prime: 29761

Next Prime: 29789

Digit Sum: 31

Digital Root: 4

Palindrome: No

Factorization: 2 ⁴ × 1861

Divisors: 1, 2, 4, 8, 16, 1861, 3722, 7444, 14888, 29776

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010001010000

Octal: 72120

Duodecimal: 15294

Hexadecimal: 7450

Square: 886610176

Square Root: 172.55723688098394

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

Expansion of 1 / ∏_k>=1 (1-x^k-x^2·k). A162891

T(n,k) = number of defective 4-colorings of an n X k 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229755

Keys added to a map T initialized with T[1] = 1 and updated at each iteration according to T[value] := (T[value] if defined else 0) + key, for all (key, value) pairs already in T; listed in order the keys are added to the map (cf. comments for details). A390939

a(n) = ∑_k=0..n binomial(n,k) * binomial(3·n+4·k,k). A388728

The right-hand half-triangle of A185356 (or A202690). A202815

Value of T[2] after the n-th iteration, when the map T is initialized with T[1] = 1 and in subsequent iterations, T[v] = k + (T[v] if defined else 0) for all key-value pairs (k, v) in T; a(n) = 0 if T[2] isn't defined yet. A390942

Number of defective 4-colorings of an n X 5 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229752

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

Number of defective 4-colorings of an n X n 0..3 array connected horizontally, vertically, diagonally and antidiagonally with exactly two mistakes, and colors introduced in row-major 0..3 order. A229748

Irregular triangle T(n,k) of Arnold numbers with n>=1 and 1<= abs(k) <= n. A335335