Base | Representation |
---|---|
bin | 10111000000110100000110… |
… | …011010110011101101111000 |
3 | 111021100200022110002021100221 |
4 | 113000310012122303231320 |
5 | 101231220123034133422 |
6 | 555131410321105424 |
7 | 30214153141366150 |
oct | 2700640632635570 |
9 | 437320273067327 |
10 | 101211012021112 |
11 | 2a2813927a1764 |
12 | b427457188274 |
13 | 4462207ca6a76 |
14 | 1adc8d3a59760 |
15 | ba7ae61213c7 |
hex | 5c0d066b3b78 |
101211012021112 has 16 divisors (see below), whose sum is σ = 216880740045360. Its totient is φ = 43376148009024.
The previous prime is 101211012021109. The next prime is 101211012021193. The reversal of 101211012021112 is 211120210112101.
It is a super-2 number, since 2×1012110120211122 (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 3 ways as a sum of consecutive naturals, for example, 903669750133 + ... + 903669750244.
It is an arithmetic number, because the mean of its divisors is an integer number (13555046252835).
Almost surely, 2101211012021112 is an apocalyptic number.
It is an amenable number.
101211012021112 is an abundant number, since it is smaller than the sum of its proper divisors (115669728024248).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101211012021112 is a wasteful number, since it uses less digits than its factorization.
101211012021112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1807339500390 (or 1807339500386 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 101211012021112 its reverse (211120210112101), we get a palindrome (312331222133213).
The spelling of 101211012021112 in words is "one hundred one trillion, two hundred eleven billion, twelve million, twenty-one thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •