ℕ atory
Play Now

Properties of the Number 31010

Thirty-One Thousand Ten

Basics

Value: 31009 → 31010 → 31011

Parity: even

Prime: No

Previous Prime: 30983

Next Prime: 31013

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 × 5 × 7 × 443

Divisors: 1, 2, 5, 7, 10, 14, 35, 70, 443, 886

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

4823 Try Today's Challenge

Representations

Binary: 111100100100010

Octal: 74442

Duodecimal: 15B42

Hexadecimal: 7922

Square: 961620100

Square Root: 176.09656441850308

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

Irregular triangle read by rows: row n lists the strings of the MIU formal system at the n-th level of the tree generated by recursively applying the system rules, starting from the MI string (see comments and example). A368946
Irregular triangle read by rows: row n lists all of the distinct derivable strings in the MIU formal system that are n characters long. A369173
Łukasiewicz word for each rooted plane tree (interpretation e in Stanley's exercise 19) encoded by A014486 (or A063171), with the last leaf implicit, i.e., these words are given without the last trailing zero, except for the null tree which is encoded as 0. A71153
Difference between A000294 and the number of solid partitions of n (A000293). A7326
a(n) = n*(n-1)*(n2 + 2)/6. A71244
Irregular triangle read by rows: row n lists (in lexicographical order and with duplicates removed) the strings of the MIU formal system at the n-th level of the tree generated by recursively applying the system rules, starting from the MI string. A368953
a(n) = -a(n-1) -a(n-2) -a(n-3) +a(n-4), a(0)=0, a(1)=1, a(2)=-1, a(3)=0. A100329
5-Smith numbers. A103126
Records in heights of cyclotomic polynomials (A160338). A160339
The number of ways to color the vertices of all (11) simple unlabeled graphs on 4 nodes using at most n colors. A199394