Base | Representation |
---|---|
bin | 100001011100000… |
… | …1000011110100011 |
3 | 2220012021001210120 |
4 | 1002320020132203 |
5 | 4244213323133 |
6 | 303200331323 |
7 | 36542636136 |
oct | 10270103643 |
9 | 2805231716 |
10 | 1122011043 |
11 | 52638955a |
12 | 273913b43 |
13 | 14b5b957a |
14 | a902c21d |
15 | 68782ab3 |
hex | 42e087a3 |
1122011043 has 16 divisors (see below), whose sum is σ = 1541707776. Its totient is φ = 725380160.
The previous prime is 1122011029. The next prime is 1122011057. The reversal of 1122011043 is 3401102211.
It is an interprime number because it is at equal distance from previous prime (1122011029) and next prime (1122011057).
It is a cyclic number.
It is not a de Polignac number, because 1122011043 - 26 = 1122010979 is a prime.
It is a super-2 number, since 2×11220110432 = 2517817561227895698, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1122011063) 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 in 15 ways as a sum of consecutive naturals, for example, 6771 + ... + 47852.
It is an arithmetic number, because the mean of its divisors is an integer number (96356736).
Almost surely, 21122011043 is an apocalyptic number.
1122011043 is a deficient number, since it is larger than the sum of its proper divisors (419696733).
1122011043 is a wasteful number, since it uses less digits than its factorization.
1122011043 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54834.
The product of its (nonzero) digits is 48, while the sum is 15.
The square root of 1122011043 is about 33496.4332877398. The cubic root of 1122011043 is about 1039.1200159149.
Adding to 1122011043 its reverse (3401102211), we get a palindrome (4523113254).
The spelling of 1122011043 in words is "one billion, one hundred twenty-two million, eleven thousand, forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •