Base | Representation |
---|---|
bin | 1001000110001011000100… |
… | …01101001110000101101101 |
3 | 2121211022001002102201000202 |
4 | 10203011202031032011231 |
5 | 10110213234421031341 |
6 | 110313221030003245 |
7 | 4133122451250251 |
oct | 443054215160555 |
9 | 77738032381022 |
10 | 20003310330221 |
11 | 64123a1218139 |
12 | 22b09381a6525 |
13 | b213c507200a |
14 | 4d2245b66261 |
15 | 24a4ea7c979b |
hex | 12316234e16d |
20003310330221 has 2 divisors, whose sum is σ = 20003310330222. Its totient is φ = 20003310330220.
The previous prime is 20003310330203. The next prime is 20003310330259. The reversal of 20003310330221 is 12203301330002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 17214109722121 + 2789200608100 = 4148989^2 + 1670090^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20003310330221 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 20003310330193 and 20003310330202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20003310330271) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10001655165110 + 10001655165111.
It is an arithmetic number, because the mean of its divisors is an integer number (10001655165111).
Almost surely, 220003310330221 is an apocalyptic number.
It is an amenable number.
20003310330221 is a deficient number, since it is larger than the sum of its proper divisors (1).
20003310330221 is an equidigital number, since it uses as much as digits as its factorization.
20003310330221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 648, while the sum is 20.
Adding to 20003310330221 its reverse (12203301330002), we get a palindrome (32206611660223).
The spelling of 20003310330221 in words is "twenty trillion, three billion, three hundred ten million, three hundred thirty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •