Base | Representation |
---|---|
bin | 1001001001000001011011… |
… | …00011011100000110001001 |
3 | 2122011122201222012200211120 |
4 | 10210200231203130012021 |
5 | 10113314240032210441 |
6 | 110430211405345453 |
7 | 4143156516065136 |
oct | 444405543340611 |
9 | 78148658180746 |
10 | 20101211210121 |
11 | 644a96a766238 |
12 | 23078bab68289 |
13 | b2a6c7a11252 |
14 | 4d6c920c958d |
15 | 24cd2a5c2966 |
hex | 12482d8dc189 |
20101211210121 has 32 divisors (see below), whose sum is σ = 27417986039808. Its totient is φ = 13095819918720.
The previous prime is 20101211210111. The next prime is 20101211210141. The reversal of 20101211210121 is 12101211210102.
It is a happy number.
It is not a de Polignac number, because 20101211210121 - 210 = 20101211209097 is a prime.
It is a super-2 number, since 2×201012112101212 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20101211210121.
It is not an unprimeable number, because it can be changed into a prime (20101211210111) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 453924501 + ... + 453968781.
It is an arithmetic number, because the mean of its divisors is an integer number (856812063744).
Almost surely, 220101211210121 is an apocalyptic number.
It is an amenable number.
20101211210121 is a deficient number, since it is larger than the sum of its proper divisors (7316774829687).
20101211210121 is a wasteful number, since it uses less digits than its factorization.
20101211210121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62261.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 20101211210121 its reverse (12101211210102), we get a palindrome (32202422420223).
The spelling of 20101211210121 in words is "twenty trillion, one hundred one billion, two hundred eleven million, two hundred ten thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •