Base | Representation |
---|---|
bin | 1001001001010001110101… |
… | …01010100010110011101101 |
3 | 2122012111110221121000220111 |
4 | 10210220322222202303231 |
5 | 10113440310401023041 |
6 | 110434225520220021 |
7 | 4143621033026332 |
oct | 444507252426355 |
9 | 78174427530814 |
10 | 20110021111021 |
11 | 6453680717176 |
12 | 230955946a611 |
13 | b2b49cc9296a |
14 | 4d748a178989 |
15 | 24d193c4d981 |
hex | 124a3aaa2ced |
20110021111021 has 8 divisors (see below), whose sum is σ = 20617244258688. Its totient is φ = 19603594860000.
The previous prime is 20110021110979. The next prime is 20110021111043. The reversal of 20110021111021 is 12011112001102.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 20110021111021 - 221 = 20110019013869 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20110021110992 and 20110021111010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20110021115021) 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, 199173055 + ... + 199273996.
It is an arithmetic number, because the mean of its divisors is an integer number (2577155532336).
Almost surely, 220110021111021 is an apocalyptic number.
It is an amenable number.
20110021111021 is a deficient number, since it is larger than the sum of its proper divisors (507223147667).
20110021111021 is a wasteful number, since it uses less digits than its factorization.
20110021111021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 398448323.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 20110021111021 its reverse (12011112001102), we get a palindrome (32121133112123).
The spelling of 20110021111021 in words is "twenty trillion, one hundred ten billion, twenty-one million, one hundred eleven thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •