Base | Representation |
---|---|
bin | 100001101000111… |
… | …0010100010001101 |
3 | 2220122220202221201 |
4 | 1003101302202031 |
5 | 4302424040114 |
6 | 304000425501 |
7 | 36654051106 |
oct | 10321624215 |
9 | 2818822851 |
10 | 1128736909 |
11 | 52a162823 |
12 | 276018291 |
13 | 14cb02a81 |
14 | a9c9d3ad |
15 | 69160874 |
hex | 4347288d |
1128736909 has 2 divisors, whose sum is σ = 1128736910. Its totient is φ = 1128736908.
The previous prime is 1128736907. The next prime is 1128736949. The reversal of 1128736909 is 9096378211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 899820009 + 228916900 = 29997^2 + 15130^2 .
It is an emirp because it is prime and its reverse (9096378211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1128736909 - 21 = 1128736907 is a prime.
Together with 1128736907, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1128736907) 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, 564368454 + 564368455.
It is an arithmetic number, because the mean of its divisors is an integer number (564368455).
Almost surely, 21128736909 is an apocalyptic number.
It is an amenable number.
1128736909 is a deficient number, since it is larger than the sum of its proper divisors (1).
1128736909 is an equidigital number, since it uses as much as digits as its factorization.
1128736909 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 163296, while the sum is 46.
The square root of 1128736909 is about 33596.6800294315. The cubic root of 1128736909 is about 1041.1922068144.
The spelling of 1128736909 in words is "one billion, one hundred twenty-eight million, seven hundred thirty-six thousand, nine hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •