Base | Representation |
---|---|
bin | 1001000110000111001011… |
… | …00111101100111000101111 |
3 | 2121211002122102100000210111 |
4 | 10203003211213230320233 |
5 | 10110144444322320421 |
6 | 110312233401320451 |
7 | 4133016610616236 |
oct | 443034547547057 |
9 | 77732572300714 |
10 | 20001220120111 |
11 | 641151936636a |
12 | 22b0454196127 |
13 | b211510011b9 |
14 | 4d20c8307b1d |
15 | 24a427047ee1 |
hex | 1230e59ece2f |
20001220120111 has 8 divisors (see below), whose sum is σ = 20004099260400. Its totient is φ = 19998341213760.
The previous prime is 20001220120081. The next prime is 20001220120121. The reversal of 20001220120111 is 11102102210002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20001220120111 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20001220120091 and 20001220120100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20001220120121) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 231744876 + ... + 231831166.
It is an arithmetic number, because the mean of its divisors is an integer number (2500512407550).
Almost surely, 220001220120111 is an apocalyptic number.
20001220120111 is a deficient number, since it is larger than the sum of its proper divisors (2879140289).
20001220120111 is a wasteful number, since it uses less digits than its factorization.
20001220120111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 116969.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 20001220120111 its reverse (11102102210002), we get a palindrome (31103322330113).
The spelling of 20001220120111 in words is "twenty trillion, one billion, two hundred twenty million, one hundred twenty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •