Base | Representation |
---|---|
bin | 100001010001001… |
… | …0100010000101101 |
3 | 2212210111111221101 |
4 | 1002202110100231 |
5 | 4241232322031 |
6 | 302434003101 |
7 | 36443220016 |
oct | 10242242055 |
9 | 2783444841 |
10 | 1116292141 |
11 | 523132898 |
12 | 271a16491 |
13 | 14a3664c3 |
14 | a838000d |
15 | 68003361 |
hex | 4289442d |
1116292141 has 2 divisors, whose sum is σ = 1116292142. Its totient is φ = 1116292140.
The previous prime is 1116292127. The next prime is 1116292153. The reversal of 1116292141 is 1412926111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 566202025 + 550090116 = 23795^2 + 23454^2 .
It is an emirp because it is prime and its reverse (1412926111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1116292141 - 27 = 1116292013 is a prime.
It is a super-2 number, since 2×11162921412 = 2492216288116727762, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1116292241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 558146070 + 558146071.
It is an arithmetic number, because the mean of its divisors is an integer number (558146071).
Almost surely, 21116292141 is an apocalyptic number.
It is an amenable number.
1116292141 is a deficient number, since it is larger than the sum of its proper divisors (1).
1116292141 is an equidigital number, since it uses as much as digits as its factorization.
1116292141 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 864, while the sum is 28.
The square root of 1116292141 is about 33410.9583969092. The cubic root of 1116292141 is about 1037.3515393319.
The spelling of 1116292141 in words is "one billion, one hundred sixteen million, two hundred ninety-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •