Base | Representation |
---|---|
bin | 1001001100011110101100… |
… | …00010110001001001101111 |
3 | 2122121000100201020202200020 |
4 | 10212033112002301021233 |
5 | 10122241031020041421 |
6 | 111000535110533223 |
7 | 4154563334100354 |
oct | 446172602611157 |
9 | 78530321222606 |
10 | 20220002112111 |
11 | 64962890700aa |
12 | 2326931967213 |
13 | b38979569cb9 |
14 | 4dc920a1462b |
15 | 250e7e341dc6 |
hex | 1263d60b126f |
20220002112111 has 4 divisors (see below), whose sum is σ = 26960002816152. Its totient is φ = 13480001408072.
The previous prime is 20220002112109. The next prime is 20220002112113. The reversal of 20220002112111 is 11121120002202.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (20220002112109) and next prime (20220002112113).
It is a cyclic number.
It is not a de Polignac number, because 20220002112111 - 21 = 20220002112109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20220002112113) 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, 3370000352016 + ... + 3370000352021.
It is an arithmetic number, because the mean of its divisors is an integer number (6740000704038).
Almost surely, 220220002112111 is an apocalyptic number.
20220002112111 is a deficient number, since it is larger than the sum of its proper divisors (6740000704041).
20220002112111 is an equidigital number, since it uses as much as digits as its factorization.
20220002112111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6740000704040.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 20220002112111 its reverse (11121120002202), we get a palindrome (31341122114313).
The spelling of 20220002112111 in words is "twenty trillion, two hundred twenty billion, two million, one hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •