Base | Representation |
---|---|
bin | 100001011100110… |
… | …1100111100000101 |
3 | 2220020000222020221 |
4 | 1002321230330011 |
5 | 4244320010113 |
6 | 303213224341 |
7 | 36546301621 |
oct | 10271547405 |
9 | 2806028227 |
10 | 1122422533 |
11 | 52663a731 |
12 | 273a920b1 |
13 | 14b70195b |
14 | a90d8181 |
15 | 6881498d |
hex | 42e6cf05 |
1122422533 has 2 divisors, whose sum is σ = 1122422534. Its totient is φ = 1122422532.
The previous prime is 1122422489. The next prime is 1122422579. The reversal of 1122422533 is 3352242211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1114024129 + 8398404 = 33377^2 + 2898^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122422533 - 217 = 1122291461 is a prime.
It is a super-2 number, since 2×11224225332 = 2519664685172272178, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1122422498 and 1122422507.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1122425533) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561211266 + 561211267.
It is an arithmetic number, because the mean of its divisors is an integer number (561211267).
Almost surely, 21122422533 is an apocalyptic number.
It is an amenable number.
1122422533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122422533 is an equidigital number, since it uses as much as digits as its factorization.
1122422533 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2880, while the sum is 25.
The square root of 1122422533 is about 33502.5750204369. The cubic root of 1122422533 is about 1039.2470304802.
Adding to 1122422533 its reverse (3352242211), we get a palindrome (4474664744).
The spelling of 1122422533 in words is "one billion, one hundred twenty-two million, four hundred twenty-two thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •