Base | Representation |
---|---|
bin | 1001000110010111101111… |
… | …00111100100101101110001 |
3 | 2121211221121002222220011011 |
4 | 10203023313213210231301 |
5 | 10110321202133323441 |
6 | 110320304001350521 |
7 | 4133453141502601 |
oct | 443136747445561 |
9 | 77757532886134 |
10 | 20010112011121 |
11 | 6415271627721 |
12 | 22b2116038441 |
13 | b21c3a25ba7b |
14 | 4d26cd21ac01 |
15 | 24a7979bc581 |
hex | 1232f79e4b71 |
20010112011121 has 10 divisors (see below), whose sum is σ = 21121776507922. Its totient is φ = 18956948097600.
The previous prime is 20010112011101. The next prime is 20010112011163. The reversal of 20010112011121 is 12111021101002.
It is a happy number.
It can be written as a sum of positive squares in only one way, i.e., 14753588281600 + 5256523729521 = 3841040^2 + 2292711^2 .
It is not a de Polignac number, because 20010112011121 - 223 = 20010103622513 is a prime.
It is a super-2 number, since 2×200101120111212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20010112011101) by changing a digit.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 76642080 + ... + 76902721.
Almost surely, 220010112011121 is an apocalyptic number.
It is an amenable number.
20010112011121 is a deficient number, since it is larger than the sum of its proper divisors (1111664496801).
20010112011121 is an frugal number, since it uses more digits than its factorization.
20010112011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 153544877 (or 153544820 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20010112011121 its reverse (12111021101002), we get a palindrome (32121133112123).
The spelling of 20010112011121 in words is "twenty trillion, ten billion, one hundred twelve million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •