Base | Representation |
---|---|
bin | 10111000000110011010110… |
… | …101111110001100101000100 |
3 | 111021100121020201002201011122 |
4 | 113000303112233301211010 |
5 | 101231212003311223022 |
6 | 555131155110253112 |
7 | 30214124260203242 |
oct | 2700632657614504 |
9 | 437317221081148 |
10 | 101210212211012 |
11 | 2a281012280583 |
12 | b427273357198 |
13 | 446210b38c458 |
14 | 1adc85973d792 |
15 | ba7a9acd5742 |
hex | 5c0cd6bf1944 |
101210212211012 has 12 divisors (see below), whose sum is σ = 177271753107456. Its totient is φ = 50561139894600.
The previous prime is 101210212211011. The next prime is 101210212211021. The reversal of 101210212211012 is 210112212012101.
It is a super-2 number, since 2×1012102122110122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (101210212211011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 10991547548 + ... + 10991556755.
It is an arithmetic number, because the mean of its divisors is an integer number (14772646092288).
Almost surely, 2101210212211012 is an apocalyptic number.
It is an amenable number.
101210212211012 is a deficient number, since it is larger than the sum of its proper divisors (76061540896444).
101210212211012 is a wasteful number, since it uses less digits than its factorization.
101210212211012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21983105458 (or 21983105456 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 101210212211012 its reverse (210112212012101), we get a palindrome (311322424223113).
The spelling of 101210212211012 in words is "one hundred one trillion, two hundred ten billion, two hundred twelve million, two hundred eleven thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 1.086 sec. • engine limits •