Base | Representation |
---|---|
bin | 100010010000100… |
… | …0011100010110001 |
3 | 2222010000110102221 |
4 | 1010201003202301 |
5 | 4323234002303 |
6 | 310022041041 |
7 | 40325503315 |
oct | 10441034261 |
9 | 2863013387 |
10 | 1149515953 |
11 | 53a965393 |
12 | 280b79181 |
13 | 1541c9971 |
14 | ac94bb45 |
15 | 6adb74bd |
hex | 448438b1 |
1149515953 has 2 divisors, whose sum is σ = 1149515954. Its totient is φ = 1149515952.
The previous prime is 1149515921. The next prime is 1149515957. The reversal of 1149515953 is 3595159411.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1120107024 + 29408929 = 33468^2 + 5423^2 .
It is an emirp because it is prime and its reverse (3595159411) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1149515953 - 25 = 1149515921 is a prime.
It is not a weakly prime, because it can be changed into another prime (1149515957) 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, 574757976 + 574757977.
It is an arithmetic number, because the mean of its divisors is an integer number (574757977).
Almost surely, 21149515953 is an apocalyptic number.
It is an amenable number.
1149515953 is a deficient number, since it is larger than the sum of its proper divisors (1).
1149515953 is an equidigital number, since it uses as much as digits as its factorization.
1149515953 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 121500, while the sum is 43.
The square root of 1149515953 is about 33904.5122808160. The cubic root of 1149515953 is about 1047.5425380545.
The spelling of 1149515953 in words is "one billion, one hundred forty-nine million, five hundred fifteen thousand, nine hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •