Base | Representation |
---|---|
bin | 1001000110001010100010… |
… | …00101111001111111011101 |
3 | 2121211021022002010222201022 |
4 | 10203011101011321333131 |
5 | 10110212142414401341 |
6 | 110313132331453525 |
7 | 4133112363552455 |
oct | 443052105717735 |
9 | 77737262128638 |
10 | 20003023200221 |
11 | 6412264134116 |
12 | 22b0877bb72a5 |
13 | b2137a72c1c9 |
14 | 4d2219982d65 |
15 | 24a4d04ade4b |
hex | 123151179fdd |
20003023200221 has 2 divisors, whose sum is σ = 20003023200222. Its totient is φ = 20003023200220.
The previous prime is 20003023200157. The next prime is 20003023200233. The reversal of 20003023200221 is 12200232030002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11971523880121 + 8031499320100 = 3459989^2 + 2833990^2 .
It is a cyclic number.
It is not a de Polignac number, because 20003023200221 - 26 = 20003023200157 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 20003023200221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20003023500221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001511600110 + 10001511600111.
It is an arithmetic number, because the mean of its divisors is an integer number (10001511600111).
Almost surely, 220003023200221 is an apocalyptic number.
It is an amenable number.
20003023200221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20003023200221 is an equidigital number, since it uses as much as digits as its factorization.
20003023200221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 17.
Adding to 20003023200221 its reverse (12200232030002), we get a palindrome (32203255230223).
The spelling of 20003023200221 in words is "twenty trillion, three billion, twenty-three million, two hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •