Base | Representation |
---|---|
bin | 10111000000110101000111… |
… | …011001100011010110111000 |
3 | 111021100210010102110122202012 |
4 | 113000311013121203112320 |
5 | 101231224341131223000 |
6 | 555132110423425052 |
7 | 30214222150013264 |
oct | 2700650731432670 |
9 | 437323112418665 |
10 | 101212102211000 |
11 | 2a2818a2116540 |
12 | b4277002b5188 |
13 | 446234cb01441 |
14 | 1adc9987630a4 |
15 | ba7b5bbba735 |
hex | 5c0d476635b8 |
101212102211000 has 64 divisors (see below), whose sum is σ = 258366893672160. Its totient is φ = 36804400800000.
The previous prime is 101212102210981. The next prime is 101212102211083. The reversal of 101212102211000 is 112201212101.
It is a super-2 number, since 2×1012121022110002 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 4600539101 + ... + 4600561100.
Almost surely, 2101212102211000 is an apocalyptic number.
101212102211000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101212102211000 is an abundant number, since it is smaller than the sum of its proper divisors (157154791461160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101212102211000 is a wasteful number, since it uses less digits than its factorization.
101212102211000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9201100233 (or 9201100219 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 101212102211000 its reverse (112201212101), we get a palindrome (101324303423101).
The spelling of 101212102211000 in words is "one hundred one trillion, two hundred twelve billion, one hundred two million, two hundred eleven thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •