Base | Representation |
---|---|
bin | 1001001100001111110011… |
… | …01111100000111101001101 |
3 | 2122120020201210202210212021 |
4 | 10212013321233200331031 |
5 | 10122123144321011341 |
6 | 110553134132010141 |
7 | 4154161322514640 |
oct | 446077157407515 |
9 | 78506653683767 |
10 | 20212011110221 |
11 | 6492958389107 |
12 | 2325281760951 |
13 | b37ca4b57708 |
14 | 4dc3a360da57 |
15 | 250b62a229d1 |
hex | 1261f9be0f4d |
20212011110221 has 8 divisors (see below), whose sum is σ = 24458231931840. Its totient is φ = 16305487954368.
The previous prime is 20212011110219. The next prime is 20212011110297. The reversal of 20212011110221 is 12201111021202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20212011110221 - 21 = 20212011110219 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20212011110195 and 20212011110204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20212011110821) 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, 84924416311 + ... + 84924416548.
It is an arithmetic number, because the mean of its divisors is an integer number (3057278991480).
Almost surely, 220212011110221 is an apocalyptic number.
It is an amenable number.
20212011110221 is a deficient number, since it is larger than the sum of its proper divisors (4246220821619).
20212011110221 is a wasteful number, since it uses less digits than its factorization.
20212011110221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 169848832883.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20212011110221 its reverse (12201111021202), we get a palindrome (32413122131423).
The spelling of 20212011110221 in words is "twenty trillion, two hundred twelve billion, eleven million, one hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •