Properties of the Number 31100

Thirty-One Thousand One Hundred

Basics

Value: 31099 → 31100 → 31101

Parity: even

Prime: No

Previous Prime: 31091

Next Prime: 31121

Digit Sum: 5

Digital Root: 5

Palindrome: No

Factorization: 2 ² × 5 ² × 311

Divisors: 1, 2, 4, 5, 10, 20, 25, 50, 100, 311

Polygonal

Triangular: No

Square: No

Pentagonal: No

Hexagonal: No

Heptagonal: No

Tetrahedral: No

Today's Target

2196 Try Today's Challenge

Representations

Binary: 111100101111100

Octal: 74574

Duodecimal: 15BB8

Hexadecimal: 797c

Square: 967210000

Square Root: 176.351920885484

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 all of the distinct derivable strings in the MIU formal system that are n characters long. A369173

Number of ways to place 5 nonattacking queens on a 5 X n board. A61991

Each permutation in the list A060117 converted to Site Swap notation, with digits reversed. "Zero throws" (fixed elements) indicated with 0's. A60496

"Inside numbers". Pick a term "t" and one of its digits "d". Now jump to the right over d digits if "d" is odd, and to the left over d digits if "d" is even. Whatever the "d" you choose, you will stay on "t". A284515

Expansion of x * (d/dx) ∑_k>=0 k!*x^k*(k+1/2)/∏_j=1..k (1 - x^j). A304797

Łukasiewicz words (without the last zero) for rooted plane trees where non-leaf branching can occur only at the leftmost branch of any level, but nowhere else. A209644

Let σ*_m (n) be result of applying sum of anti-divisors m times to n; call n (m,k)-anti-perfect if σ*_m (n) = k·n; sequence gives the (3,k)-anti-perfect numbers. A229861

Numbers n = x0 x1 x2...x9 such that ξ is the number of digits greater than i in n. A226195

Write 2n-1 in base 9 and juxtapose. A31100

Consider all compositions (ordered partitions) of n into n parts, allowing zeros. E.g., for n = 3 we get 300, 030, 003, 210, 120, 201, 102, 021, 012, 111. Then a(n) is the total number of 1's. A97070