Base | Representation |
---|---|
bin | 1001000110010110000000… |
… | …01011111100001011001101 |
3 | 2121211212012022001110120201 |
4 | 10203023000023330023031 |
5 | 10110312301044122201 |
6 | 110320031420413501 |
7 | 4133421116634235 |
oct | 443130013741315 |
9 | 77755168043521 |
10 | 20009182020301 |
11 | 6414934680871 |
12 | 22b1ab66a7291 |
13 | b21b1c694646 |
14 | 4d26418d4cc5 |
15 | 24a741019801 |
hex | 1232c02fc2cd |
20009182020301 has 2 divisors, whose sum is σ = 20009182020302. Its totient is φ = 20009182020300.
The previous prime is 20009182020197. The next prime is 20009182020323. The reversal of 20009182020301 is 10302028190002.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 15803216806276 + 4205965214025 = 3975326^2 + 2050845^2 .
It is a cyclic number.
It is not a de Polignac number, because 20009182020301 - 235 = 19974822281933 is a prime.
It is a super-2 number, since 2×200091820203012 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20009182020301.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20009182020371) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10004591010150 + 10004591010151.
It is an arithmetic number, because the mean of its divisors is an integer number (10004591010151).
Almost surely, 220009182020301 is an apocalyptic number.
It is an amenable number.
20009182020301 is a deficient number, since it is larger than the sum of its proper divisors (1).
20009182020301 is an equidigital number, since it uses as much as digits as its factorization.
20009182020301 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 28.
The spelling of 20009182020301 in words is "twenty trillion, nine billion, one hundred eighty-two million, twenty thousand, three hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.224 sec. • engine limits •