Base | Representation |
---|---|
bin | 1001000111000010100100… |
… | …00000011101100001101001 |
3 | 2121221010221102012110101211 |
4 | 10203201102000131201221 |
5 | 10111210243422234233 |
6 | 110335025225113121 |
7 | 4135225655430244 |
oct | 443412200354151 |
9 | 77833842173354 |
10 | 20033103321193 |
11 | 6423a9a621226 |
12 | 22b66719287a1 |
13 | b24162597761 |
14 | 4d38708c625b |
15 | 24b1911625cd |
hex | 12385201d869 |
20033103321193 has 2 divisors, whose sum is σ = 20033103321194. Its totient is φ = 20033103321192.
The previous prime is 20033103321181. The next prime is 20033103321223. The reversal of 20033103321193 is 39112330133002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14733406681744 + 5299696639449 = 3838412^2 + 2302107^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20033103321193 is a prime.
It is not a weakly prime, because it can be changed into another prime (20033103321113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10016551660596 + 10016551660597.
It is an arithmetic number, because the mean of its divisors is an integer number (10016551660597).
Almost surely, 220033103321193 is an apocalyptic number.
It is an amenable number.
20033103321193 is a deficient number, since it is larger than the sum of its proper divisors (1).
20033103321193 is an equidigital number, since it uses as much as digits as its factorization.
20033103321193 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8748, while the sum is 31.
Adding to 20033103321193 its reverse (39112330133002), we get a palindrome (59145433454195).
The spelling of 20033103321193 in words is "twenty trillion, thirty-three billion, one hundred three million, three hundred twenty-one thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •