Base | Representation |
---|---|
bin | 100001001001010… |
… | …1110010000110101 |
3 | 2212111210211112101 |
4 | 1002102232100311 |
5 | 4234211014331 |
6 | 302210222101 |
7 | 36363403153 |
oct | 10222562065 |
9 | 2774724471 |
10 | 1112204341 |
11 | 5208a0646 |
12 | 270584931 |
13 | 1495649a1 |
14 | a79d83d3 |
15 | 67997061 |
hex | 424ae435 |
1112204341 has 2 divisors, whose sum is σ = 1112204342. Its totient is φ = 1112204340.
The previous prime is 1112204323. The next prime is 1112204351. The reversal of 1112204341 is 1434022111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 839260900 + 272943441 = 28970^2 + 16521^2 .
It is a cyclic number.
It is not a de Polignac number, because 1112204341 - 25 = 1112204309 is a prime.
It is a super-2 number, since 2×11122043412 = 2473996992278488562, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112204351) 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, 556102170 + 556102171.
It is an arithmetic number, because the mean of its divisors is an integer number (556102171).
Almost surely, 21112204341 is an apocalyptic number.
It is an amenable number.
1112204341 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112204341 is an equidigital number, since it uses as much as digits as its factorization.
1112204341 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
The square root of 1112204341 is about 33349.7277500132. The cubic root of 1112204341 is about 1036.0837492485.
Adding to 1112204341 its reverse (1434022111), we get a palindrome (2546226452).
The spelling of 1112204341 in words is "one billion, one hundred twelve million, two hundred four thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •