ℕ atory
Play Now

Properties of the Number 29912

Twenty-Nine Thousand Nine Hundred Twelve

Basics

Value: 29911 → 29912 → 29913

Parity: even

Prime: No

Previous Prime: 29881

Next Prime: 29917

Digit Sum: 23

Digital Root: 5

Palindrome: No

Factorization: 2 3 × 3739

Divisors: 1, 2, 4, 8, 3739, 7478, 14956, 29912

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010011011000

Octal: 72330

Duodecimal: 15388

Hexadecimal: 74d8

Square: 894727744

Square Root: 172.95086007302768

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

Sum of the fourth largest parts of the partitions of n into 10 parts. A326595
T(n,k)=3-level binary fanout graph coloring a rectangular array: number of nXk 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223423
Number of non-equivalent ways to tile an n X n X n triangular area with two 2 X 2 X 2 triangular tiles and an appropriate number (= n2-8) of 1 X 1 X 1 tiles. A286444
3-level binary fanout graph coloring a rectangular array: number of n X 3 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223418
3-level binary fanout graph coloring a rectangular array: number of nX5 0..6 arrays where 0..6 label nodes of a graph with edges 0,1 1,3 1,4 0,2 2,5 2,6 and every array movement to a horizontal or vertical neighbor moves along an edge of this graph. A223420
Number of (n+2) X (3+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order. A253020
Start with n; repeatedly sum prime factors (counted with multiplicity) and add 1, until reach 1, 6 or a prime. A29912