Base | Representation |
---|---|
bin | 10110101111101001010100… |
… | …111011001000011110100010 |
3 | 111010011220001020021212101100 |
4 | 112233221110323020132202 |
5 | 101102402411024024302 |
6 | 552425412132015230 |
7 | 30033005466204402 |
oct | 2657512473103642 |
9 | 433156036255340 |
10 | 100031213111202 |
11 | 29966aa9aa164a |
12 | b276876a61516 |
13 | 43a7b97943209 |
14 | 1a9b772400802 |
15 | b87094b73d1c |
hex | 5afa54ec87a2 |
100031213111202 has 24 divisors (see below), whose sum is σ = 217306153387440. Its totient is φ = 33255759501720.
The previous prime is 100031213111201. The next prime is 100031213111213. The reversal of 100031213111202 is 202111312130001.
100031213111202 is a `hidden beast` number, since 10 + 0 + 0 + 312 + 131 + 11 + 202 = 666.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is not an unprimeable number, because it can be changed into a prime (100031213111201) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 7331509824 + ... + 7331523467.
It is an arithmetic number, because the mean of its divisors is an integer number (9054423057810).
Almost surely, 2100031213111202 is an apocalyptic number.
100031213111202 is an abundant number, since it is smaller than the sum of its proper divisors (117274940276238).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100031213111202 is a wasteful number, since it uses less digits than its factorization.
100031213111202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14663033678 (or 14663033675 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 18.
Adding to 100031213111202 its reverse (202111312130001), we get a palindrome (302142525241203).
The spelling of 100031213111202 in words is "one hundred trillion, thirty-one billion, two hundred thirteen million, one hundred eleven thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •