Base | Representation |
---|---|
bin | 1001001001010101101101… |
… | …01101010110010110010001 |
3 | 2122012200211222120101101022 |
4 | 10210222312231112112101 |
5 | 10114004041132034301 |
6 | 110435212221445225 |
7 | 4144023433130054 |
oct | 444526655262621 |
9 | 78180758511338 |
10 | 20112102221201 |
11 | 6454549423041 |
12 | 2309a3a410815 |
13 | b2b7421987c3 |
14 | 4d7606708a9b |
15 | 24d2667d3d1b |
hex | 124ab6b56591 |
20112102221201 has 2 divisors, whose sum is σ = 20112102221202. Its totient is φ = 20112102221200.
The previous prime is 20112102221191. The next prime is 20112102221213. The reversal of 20112102221201 is 10212220121102.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 15599774619025 + 4512327602176 = 3949655^2 + 2124224^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20112102221201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20112102221201.
It is not a weakly prime, because it can be changed into another prime (20112102220201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10056051110600 + 10056051110601.
It is an arithmetic number, because the mean of its divisors is an integer number (10056051110601).
Almost surely, 220112102221201 is an apocalyptic number.
It is an amenable number.
20112102221201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20112102221201 is an equidigital number, since it uses as much as digits as its factorization.
20112102221201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20112102221201 its reverse (10212220121102), we get a palindrome (30324322342303).
The spelling of 20112102221201 in words is "twenty trillion, one hundred twelve billion, one hundred two million, two hundred twenty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.318 sec. • engine limits •