Base | Representation |
---|---|
bin | 1010000000111011100010… |
… | …11110010111000111111001 |
3 | 2212222022011001121122120102 |
4 | 11000131301132113013321 |
5 | 10341302431441023113 |
6 | 114500505354005145 |
7 | 4432023446611124 |
oct | 500356136270771 |
9 | 85868131548512 |
10 | 22022201111033 |
11 | 7020621456172 |
12 | 25780727167b5 |
13 | c398b9252ca6 |
14 | 561c4747d3bb |
15 | 282cabe6a758 |
hex | 1407717971f9 |
22022201111033 has 2 divisors, whose sum is σ = 22022201111034. Its totient is φ = 22022201111032.
The previous prime is 22022201110963. The next prime is 22022201111041. The reversal of 22022201111033 is 33011110222022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 18638319452944 + 3383881658089 = 4317212^2 + 1839533^2 .
It is a cyclic number.
It is not a de Polignac number, because 22022201111033 - 240 = 20922689483257 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 22022201110996 and 22022201111014.
It is not a weakly prime, because it can be changed into another prime (22022201111233) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11011100555516 + 11011100555517.
It is an arithmetic number, because the mean of its divisors is an integer number (11011100555517).
Almost surely, 222022201111033 is an apocalyptic number.
It is an amenable number.
22022201111033 is a deficient number, since it is larger than the sum of its proper divisors (1).
22022201111033 is an equidigital number, since it uses as much as digits as its factorization.
22022201111033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 20.
Adding to 22022201111033 its reverse (33011110222022), we get a palindrome (55033311333055).
The spelling of 22022201111033 in words is "twenty-two trillion, twenty-two billion, two hundred one million, one hundred eleven thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •