Base | Representation |
---|---|
bin | 11100111000010101… |
… | …110101111011111000 |
3 | 2222001010211021212110 |
4 | 130320111311323320 |
5 | 1002002031133422 |
6 | 22125032212320 |
7 | 2145312554550 |
oct | 347025657370 |
9 | 88033737773 |
10 | 31010021112 |
11 | 12173391924 |
12 | 601523a0a0 |
13 | 2c02700625 |
14 | 1702644160 |
15 | c1763960c |
hex | 738575ef8 |
31010021112 has 128 divisors (see below), whose sum is σ = 90816099840. Its totient is φ = 8641036800.
The previous prime is 31010021111. The next prime is 31010021149. The reversal of 31010021112 is 21112001013.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (31010021111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1123218 + ... + 1150494.
It is an arithmetic number, because the mean of its divisors is an integer number (709500780).
Almost surely, 231010021112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 31010021112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (45408049920).
31010021112 is an abundant number, since it is smaller than the sum of its proper divisors (59806078728).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
31010021112 is a wasteful number, since it uses less digits than its factorization.
31010021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27461 (or 27457 counting only the distinct ones).
The product of its (nonzero) digits is 12, while the sum is 12.
Adding to 31010021112 its reverse (21112001013), we get a palindrome (52122022125).
The spelling of 31010021112 in words is "thirty-one billion, ten million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •