Base | Representation |
---|---|
bin | 1001000111000010100100… |
… | …00000011101100001111011 |
3 | 2121221010221102012110102111 |
4 | 10203201102000131201323 |
5 | 10111210243422234321 |
6 | 110335025225113151 |
7 | 4135225655430301 |
oct | 443412200354173 |
9 | 77833842173374 |
10 | 20033103321211 |
11 | 6423a9a621242 |
12 | 22b66719287b7 |
13 | b24162597776 |
14 | 4d38708c6271 |
15 | 24b1911625e1 |
hex | 12385201d87b |
20033103321211 has 8 divisors (see below), whose sum is σ = 20483481133584. Its totient is φ = 19587702059520.
The previous prime is 20033103321193. The next prime is 20033103321223. The reversal of 20033103321211 is 11212330133002.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20033103321211 - 235 = 19998743582843 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20033103321241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1244129530 + ... + 1244145631.
It is an arithmetic number, because the mean of its divisors is an integer number (2560435141698).
Almost surely, 220033103321211 is an apocalyptic number.
20033103321211 is a deficient number, since it is larger than the sum of its proper divisors (450377812373).
20033103321211 is an equidigital number, since it uses as much as digits as its factorization.
20033103321211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2488275341.
The product of its (nonzero) digits is 648, while the sum is 22.
Adding to 20033103321211 its reverse (11212330133002), we get a palindrome (31245433454213).
The spelling of 20033103321211 in words is "twenty trillion, thirty-three billion, one hundred three million, three hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •