Base | Representation |
---|---|
bin | 1001001111011010000110… |
… | …10110011110110011101001 |
3 | 2122221122001222000110202001 |
4 | 10213231003112132303221 |
5 | 10130413112240303301 |
6 | 111115055234411001 |
7 | 4165054625104264 |
oct | 447550326366351 |
9 | 78848058013661 |
10 | 20320620244201 |
11 | 6524a21408a72 |
12 | 2342332730a61 |
13 | b452c3153474 |
14 | 503747bbbcdb |
15 | 2538bc97bc01 |
hex | 127b4359ece9 |
20320620244201 has 2 divisors, whose sum is σ = 20320620244202. Its totient is φ = 20320620244200.
The previous prime is 20320620244157. The next prime is 20320620244219. The reversal of 20320620244201 is 10244202602302.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19995519573225 + 325100670976 = 4471635^2 + 570176^2 .
It is a cyclic number.
It is not a de Polignac number, because 20320620244201 - 215 = 20320620211433 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20320620244201.
It is not a weakly prime, because it can be changed into another prime (20320620244801) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10160310122100 + 10160310122101.
It is an arithmetic number, because the mean of its divisors is an integer number (10160310122101).
Almost surely, 220320620244201 is an apocalyptic number.
It is an amenable number.
20320620244201 is a deficient number, since it is larger than the sum of its proper divisors (1).
20320620244201 is an equidigital number, since it uses as much as digits as its factorization.
20320620244201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 20320620244201 its reverse (10244202602302), we get a palindrome (30564822846503).
The spelling of 20320620244201 in words is "twenty trillion, three hundred twenty billion, six hundred twenty million, two hundred forty-four thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •