Base | Representation |
---|---|
bin | 1001100100001001001101… |
… | …00101011111011111010111 |
3 | 2202110202010001112111000202 |
4 | 10302010212211133133113 |
5 | 10224101243131223111 |
6 | 112422250155531115 |
7 | 4300406610643541 |
oct | 462044645373727 |
9 | 82422101474022 |
10 | 21033102211031 |
11 | 677a0a7959029 |
12 | 2438433459a9b |
13 | b9754a564ba1 |
14 | 52a016b20691 |
15 | 2671bc759b3b |
hex | 13212695f7d7 |
21033102211031 has 2 divisors, whose sum is σ = 21033102211032. Its totient is φ = 21033102211030.
The previous prime is 21033102211001. The next prime is 21033102211049. The reversal of 21033102211031 is 13011220133012.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-21033102211031 is a prime.
It is a super-2 number, since 2×210331022110312 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 21033102210994 and 21033102211012.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (21033102211001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10516551105515 + 10516551105516.
It is an arithmetic number, because the mean of its divisors is an integer number (10516551105516).
Almost surely, 221033102211031 is an apocalyptic number.
21033102211031 is a deficient number, since it is larger than the sum of its proper divisors (1).
21033102211031 is an equidigital number, since it uses as much as digits as its factorization.
21033102211031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 216, while the sum is 20.
Adding to 21033102211031 its reverse (13011220133012), we get a palindrome (34044322344043).
The spelling of 21033102211031 in words is "twenty-one trillion, thirty-three billion, one hundred two million, two hundred eleven thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •