Base | Representation |
---|---|
bin | 100001011100101… |
… | …0111001000001001 |
3 | 2220012212102201001 |
4 | 1002321113020021 |
5 | 4244304130233 |
6 | 303211255001 |
7 | 36545450302 |
oct | 10271271011 |
9 | 2805772631 |
10 | 1122333193 |
11 | 5265895a3 |
12 | 273a4a461 |
13 | 14b6a00a7 |
14 | a90b37a9 |
15 | 687e827d |
hex | 42e57209 |
1122333193 has 2 divisors, whose sum is σ = 1122333194. Its totient is φ = 1122333192.
The previous prime is 1122333169. The next prime is 1122333203. The reversal of 1122333193 is 3913332211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 929762064 + 192571129 = 30492^2 + 13877^2 .
It is an emirp because it is prime and its reverse (3913332211) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1122333193 is a prime.
It is a super-2 number, since 2×11223331932 = 2519263592219150498, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1122333103) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561166596 + 561166597.
It is an arithmetic number, because the mean of its divisors is an integer number (561166597).
Almost surely, 21122333193 is an apocalyptic number.
It is an amenable number.
1122333193 is a deficient number, since it is larger than the sum of its proper divisors (1).
1122333193 is an equidigital number, since it uses as much as digits as its factorization.
1122333193 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2916, while the sum is 28.
The square root of 1122333193 is about 33501.2416635563. The cubic root of 1122333193 is about 1039.2194565525.
The spelling of 1122333193 in words is "one billion, one hundred twenty-two million, three hundred thirty-three thousand, one hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •