Base | Representation |
---|---|
bin | 1001001001100110010100… |
… | …11000011000000011111111 |
3 | 2122020112212122002100211122 |
4 | 10210303022120120003333 |
5 | 10114130323140431421 |
6 | 110443245303541155 |
7 | 4144460454535235 |
oct | 444631230300377 |
9 | 78215778070748 |
10 | 20121022202111 |
11 | 645830652a796 |
12 | 230b70975a7bb |
13 | b2c5341acb0c |
14 | 4d7c11250955 |
15 | 24d5d99562ab |
hex | 124cca6180ff |
20121022202111 has 4 divisors (see below), whose sum is σ = 20121220265424. Its totient is φ = 20120824138800.
The previous prime is 20121022202107. The next prime is 20121022202147. The reversal of 20121022202111 is 11120222012102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20121022202111 - 22 = 20121022202107 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 20121022202111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20121022202101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 98879195 + ... + 99082476.
It is an arithmetic number, because the mean of its divisors is an integer number (5030305066356).
Almost surely, 220121022202111 is an apocalyptic number.
20121022202111 is a deficient number, since it is larger than the sum of its proper divisors (198063313).
20121022202111 is a wasteful number, since it uses less digits than its factorization.
20121022202111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 198063312.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20121022202111 its reverse (11120222012102), we get a palindrome (31241244214213).
The spelling of 20121022202111 in words is "twenty trillion, one hundred twenty-one billion, twenty-two million, two hundred two thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •