Base | Representation |
---|---|
bin | 1010000000100111010011… |
… | …01001010000110111101001 |
3 | 2212221021002121002112002002 |
4 | 11000103221221100313221 |
5 | 10341113202034124113 |
6 | 114451511054220345 |
7 | 4431160222535531 |
oct | 500235151206751 |
9 | 85837077075062 |
10 | 22011332333033 |
11 | 7016a542a440a |
12 | 2575b3a7b46b5 |
13 | c388765813c4 |
14 | 5614d5baa4c1 |
15 | 282872b9bc58 |
hex | 1404e9a50de9 |
22011332333033 has 2 divisors, whose sum is σ = 22011332333034. Its totient is φ = 22011332333032.
The previous prime is 22011332333009. The next prime is 22011332333041. The reversal of 22011332333033 is 33033323311022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19687039992064 + 2324292340969 = 4437008^2 + 1524563^2 .
It is a cyclic number.
It is not a de Polignac number, because 22011332333033 - 216 = 22011332267497 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22011332332987 and 22011332333005.
It is not a weakly prime, because it can be changed into another prime (22011332933033) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11005666166516 + 11005666166517.
It is an arithmetic number, because the mean of its divisors is an integer number (11005666166517).
Almost surely, 222011332333033 is an apocalyptic number.
It is an amenable number.
22011332333033 is a deficient number, since it is larger than the sum of its proper divisors (1).
22011332333033 is an equidigital number, since it uses as much as digits as its factorization.
22011332333033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 17496, while the sum is 29.
Adding to 22011332333033 its reverse (33033323311022), we get a palindrome (55044655644055).
The spelling of 22011332333033 in words is "twenty-two trillion, eleven billion, three hundred thirty-two million, three hundred thirty-three thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •