Base | Representation |
---|---|
bin | 1010000110101100011000… |
… | …10100111001100011100001 |
3 | 2220200020021100022002222221 |
4 | 11003112030110321203201 |
5 | 10403024002322023243 |
6 | 115131454520231041 |
7 | 4452233524416055 |
oct | 503261424714341 |
9 | 86606240262887 |
10 | 22220220111073 |
11 | 70975a6a77816 |
12 | 25aa51690b481 |
13 | c5248601b02a |
14 | 56b67040dc65 |
15 | 287eeb531bed |
hex | 14358c5398e1 |
22220220111073 has 2 divisors, whose sum is σ = 22220220111074. Its totient is φ = 22220220111072.
The previous prime is 22220220110923. The next prime is 22220220111149. The reversal of 22220220111073 is 37011102202222.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 19764630822049 + 2455589289024 = 4445743^2 + 1567032^2 .
It is a cyclic number.
It is not a de Polignac number, because 22220220111073 - 237 = 22082781157601 is a prime.
It is a super-2 number, since 2×222202201110732 (a number of 27 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (22220220111373) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 11110110055536 + 11110110055537.
It is an arithmetic number, because the mean of its divisors is an integer number (11110110055537).
Almost surely, 222220220111073 is an apocalyptic number.
It is an amenable number.
22220220111073 is a deficient number, since it is larger than the sum of its proper divisors (1).
22220220111073 is an equidigital number, since it uses as much as digits as its factorization.
22220220111073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1344, while the sum is 25.
Adding to 22220220111073 its reverse (37011102202222), we get a palindrome (59231322313295).
The spelling of 22220220111073 in words is "twenty-two trillion, two hundred twenty billion, two hundred twenty million, one hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •