Base | Representation |
---|---|
bin | 1100010110001000101… |
… | …0011110011111110111 |
3 | 202021110122011011201020 |
4 | 3011202022132133313 |
5 | 11433340134423111 |
6 | 241234301432223 |
7 | 21216020616510 |
oct | 3054212363767 |
9 | 667418134636 |
10 | 212100311031 |
11 | 81a51106a54 |
12 | 35133b6b673 |
13 | 170021a5c2b |
14 | a3a1171a07 |
15 | 57b590b906 |
hex | 316229e7f7 |
212100311031 has 16 divisors (see below), whose sum is σ = 323344896000. Its totient is φ = 121146019488.
The previous prime is 212100311029. The next prime is 212100311047. The reversal of 212100311031 is 130113001212.
It is a happy number.
It is not a de Polignac number, because 212100311031 - 21 = 212100311029 is a prime.
It is a super-2 number, since 2×2121003110312 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 212100311031.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (212100311131) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2208456 + ... + 2302493.
It is an arithmetic number, because the mean of its divisors is an integer number (20209056000).
Almost surely, 2212100311031 is an apocalyptic number.
212100311031 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
212100311031 is a deficient number, since it is larger than the sum of its proper divisors (111244584969).
212100311031 is a wasteful number, since it uses less digits than its factorization.
212100311031 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4513198.
The product of its (nonzero) digits is 36, while the sum is 15.
Adding to 212100311031 its reverse (130113001212), we get a palindrome (342213312243).
The spelling of 212100311031 in words is "two hundred twelve billion, one hundred million, three hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •