Base | Representation |
---|---|
bin | 1001001011111101100010… |
… | …00001010110000000011001 |
3 | 2122112022102010112022000002 |
4 | 10211332301001112000121 |
5 | 10121443101441100401 |
6 | 110544432453422345 |
7 | 4153363243100534 |
oct | 445766101260031 |
9 | 78468363468002 |
10 | 20202201112601 |
11 | 6489783948762 |
12 | 23233a433a9b5 |
13 | b370a0633ab1 |
14 | 4dbb127c9a1b |
15 | 25078b696a6b |
hex | 125fb1056019 |
20202201112601 has 2 divisors, whose sum is σ = 20202201112602. Its totient is φ = 20202201112600.
The previous prime is 20202201112589. The next prime is 20202201112607. The reversal of 20202201112601 is 10621110220202.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 17176424358025 + 3025776754576 = 4144445^2 + 1739476^2 .
It is a cyclic number.
It is not a de Polignac number, because 20202201112601 - 210 = 20202201111577 is a prime.
It is not a weakly prime, because it can be changed into another prime (20202201112607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10101100556300 + 10101100556301.
It is an arithmetic number, because the mean of its divisors is an integer number (10101100556301).
Almost surely, 220202201112601 is an apocalyptic number.
It is an amenable number.
20202201112601 is a deficient number, since it is larger than the sum of its proper divisors (1).
20202201112601 is an equidigital number, since it uses as much as digits as its factorization.
20202201112601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 20202201112601 its reverse (10621110220202), we get a palindrome (30823311332803).
The spelling of 20202201112601 in words is "twenty trillion, two hundred two billion, two hundred one million, one hundred twelve thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •