Properties of the Number 31111

Thirty-One Thousand One Hundred Eleven

Basics

Value: 31110 → 31111 → 31112

Parity: odd

Prime: No

Previous Prime: 31091

Next Prime: 31121

Digit Sum: 7

Digital Root: 7

Palindrome: No

Factorization: 53 × 587

Divisors: 1, 53, 587, 31111

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2730 Try Today's Challenge

Representations

Binary: 111100110000111

Octal: 74607

Duodecimal: 16007

Hexadecimal: 7987

Square: 967894321

Square Root: 176.38310576696398

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

Decimal encoding of the prime factorization of n: concatenation of prime factors and exponents. A67599

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

a(0) = 0; for n>0, a(n) is the smallest number greater than a(n-1) which does not use any digit used by a(n-1). A30283

Numbers with multiplicative digital root value 3. A34050

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

Irregular triangle read by rows in which n-th row lists all partitions of n, in graded reverse lexicographic ordering, using a compressed notation. A322761

Irregular triangle read by rows: row n lists the lines of a "normal" proof (see comments) for the MIU formal system string (theorem) given by A369173(n+1). A369409

T(n,k)=Number of nXk 0..6 arrays of the sum of the corresponding element, the element to the east and the element to the south in a larger (n+1)X(k+1) 0..2 array. A229437

Irregular triangle read by rows: row n lists the lines of the shortest proof for the MIU formal system string (theorem) given by A369173(n+1). A369586

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