Base | Representation |
---|---|
bin | 100001011010011… |
… | …0010000011000001 |
3 | 2220010121102222201 |
4 | 1002310302003001 |
5 | 4244002221422 |
6 | 303125433201 |
7 | 36532320364 |
oct | 10264620301 |
9 | 2803542881 |
10 | 1121132737 |
11 | 52593968a |
12 | 27356b801 |
13 | 14b36c86a |
14 | a8c800db |
15 | 6865c727 |
hex | 42d320c1 |
1121132737 has 2 divisors, whose sum is σ = 1121132738. Its totient is φ = 1121132736.
The previous prime is 1121132729. The next prime is 1121132743. The reversal of 1121132737 is 7372311211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 801116416 + 320016321 = 28304^2 + 17889^2 .
It is a cyclic number.
It is not a de Polignac number, because 1121132737 - 23 = 1121132729 is a prime.
It is a super-2 number, since 2×11211327372 = 2513877227946222338, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1121132437) 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, 560566368 + 560566369.
It is an arithmetic number, because the mean of its divisors is an integer number (560566369).
Almost surely, 21121132737 is an apocalyptic number.
It is an amenable number.
1121132737 is a deficient number, since it is larger than the sum of its proper divisors (1).
1121132737 is an equidigital number, since it uses as much as digits as its factorization.
1121132737 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1764, while the sum is 28.
The square root of 1121132737 is about 33483.3202804023. The cubic root of 1121132737 is about 1038.8488053959.
Adding to 1121132737 its reverse (7372311211), we get a palindrome (8493443948).
The spelling of 1121132737 in words is "one billion, one hundred twenty-one million, one hundred thirty-two thousand, seven hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •