Properties of the Number 29910

Twenty-Nine Thousand Nine Hundred Ten

Basics

Value: 29909 → 29910 → 29911

Parity: even

Prime: No

Previous Prime: 29881

Next Prime: 29917

Digit Sum: 21

Digital Root: 3

Palindrome: No

Factorization: 2 × 3 × 5 × 997

Divisors: 1, 2, 3, 5, 6, 10, 15, 30, 997, 1994

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111010011010110

Octal: 72326

Duodecimal: 15386

Hexadecimal: 74d6

Square: 894608100

Square Root: 172.94507798720377

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

a(n) = 5·4*3·2*1 - 10·9*8·7*6 + 15·14·13·12·11 - 20·19·18·17·16 + ... - (up to the n-th term). A319888

Number of genus 3 sensed hypermaps with n darts. A214820

Numbers n such that φ(n)=4·reversal(n). A114931

Number of dessins d'enfants D(n,g) with n edges of genus g, read by rows. A380453

Number of (3+1)X(n+1) 0..1 arrays with every 2X2 subblock ne-sw antidiagonal difference unequal to its neighbors horizontally and nw+se diagonal sum unequal to its neighbors vertically. A253700

Numbers m such that each of p=6·m+1, q=6·p+1, r=6·q+1 and s=6·r+1 is prime. A263311

Number of mutual-visibility sets in the n-ladder graph. A389183

Start with n; if prime, stop; repeatedly sum prime factors (counted with multiplicity) and add 1, until reach 1, 6 or a prime. A29910

Number of nX5 0..1 arrays with every element unequal to 0, 1, 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero. A320368