Base | Representation |
---|---|
bin | 111100001011100… |
… | …111001000110001 |
3 | 2121100212220020212 |
4 | 330023213020301 |
5 | 4031434124344 |
6 | 244104513505 |
7 | 34010053166 |
oct | 7413471061 |
9 | 2540786225 |
10 | 1009676849 |
11 | 478a33185 |
12 | 24217b895 |
13 | 13124792c |
14 | 9814a06d |
15 | 5d99379e |
hex | 3c2e7231 |
1009676849 has 2 divisors, whose sum is σ = 1009676850. Its totient is φ = 1009676848.
The previous prime is 1009676813. The next prime is 1009676897. The reversal of 1009676849 is 9486769001.
1009676849 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 821109025 + 188567824 = 28655^2 + 13732^2 .
It is an emirp because it is prime and its reverse (9486769001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1009676849 - 220 = 1008628273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1009676797 and 1009676806.
It is not a weakly prime, because it can be changed into another prime (1009676749) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 504838424 + 504838425.
It is an arithmetic number, because the mean of its divisors is an integer number (504838425).
Almost surely, 21009676849 is an apocalyptic number.
It is an amenable number.
1009676849 is a deficient number, since it is larger than the sum of its proper divisors (1).
1009676849 is an equidigital number, since it uses as much as digits as its factorization.
1009676849 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 653184, while the sum is 50.
The square root of 1009676849 is about 31775.4126487761. The cubic root of 1009676849 is about 1003.2152673097.
The spelling of 1009676849 in words is "one billion, nine million, six hundred seventy-six thousand, eight hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •