Base | Representation |
---|---|
bin | 10111000000110100000101… |
… | …101101000001110011110100 |
3 | 111021100200021121111120020011 |
4 | 113000310011231001303310 |
5 | 101231220112001121322 |
6 | 555131405211550004 |
7 | 30214152634364125 |
oct | 2700640555016364 |
9 | 437320247446204 |
10 | 101211000020212 |
11 | 2a281386a45265 |
12 | b42745315b304 |
13 | 4462205664544 |
14 | 1adc8d221404c |
15 | ba7ae5050677 |
hex | 5c0d05b41cf4 |
101211000020212 has 12 divisors (see below), whose sum is σ = 177204362616036. Its totient is φ = 50581182129920.
The previous prime is 101211000020161. The next prime is 101211000020213. The reversal of 101211000020212 is 212020000112101.
It can be written as a sum of positive squares in 2 ways, for example, as 22223059369956 + 78987940650256 = 4714134^2 + 8887516^2 .
It is a junction number, because it is equal to n+sod(n) for n = 101211000020192 and 101211000020201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101211000020213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6079460683 + ... + 6079477330.
It is an arithmetic number, because the mean of its divisors is an integer number (14767030218003).
Almost surely, 2101211000020212 is an apocalyptic number.
It is an amenable number.
101211000020212 is a deficient number, since it is larger than the sum of its proper divisors (75993362595824).
101211000020212 is a wasteful number, since it uses less digits than its factorization.
101211000020212 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12158940098 (or 12158940096 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 101211000020212 its reverse (212020000112101), we get a palindrome (313231000132313).
The spelling of 101211000020212 in words is "one hundred one trillion, two hundred eleven billion, twenty thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •