Base | Representation |
---|---|
bin | 101111001000010101… |
… | …0100000111110001100 |
3 | 100200020120221100221120 |
4 | 1132100222200332030 |
5 | 3124240043441022 |
6 | 114255033400540 |
7 | 10212052646256 |
oct | 1362052407614 |
9 | 320216840846 |
10 | 101211312012 |
11 | 39a18168808 |
12 | 17747569150 |
13 | 970c764a05 |
14 | 4c81c96cd6 |
15 | 297575bd5c |
hex | 1790aa0f8c |
101211312012 has 24 divisors (see below), whose sum is σ = 236341007616. Its totient is φ = 33711206928.
The previous prime is 101211312011. The next prime is 101211312029. The reversal of 101211312012 is 210213112101.
It is a junction number, because it is equal to n+sod(n) for n = 101211311982 and 101211312000.
It is not an unprimeable number, because it can be changed into a prime (101211312011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3220848 + ... + 3252119.
It is an arithmetic number, because the mean of its divisors is an integer number (9847541984).
Almost surely, 2101211312012 is an apocalyptic number.
101211312012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
101211312012 is an abundant number, since it is smaller than the sum of its proper divisors (135129695604).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211312012 is a wasteful number, since it uses less digits than its factorization.
101211312012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6474277 (or 6474275 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 101211312012 its reverse (210213112101), we get a palindrome (311424424113).
The spelling of 101211312012 in words is "one hundred one billion, two hundred eleven million, three hundred twelve thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •