Base | Representation |
---|---|
bin | 111101111111110… |
… | …111011010111001 |
3 | 2200111020012122101 |
4 | 331333313122321 |
5 | 4112234332444 |
6 | 251114023401 |
7 | 34530101563 |
oct | 7577673271 |
9 | 2614205571 |
10 | 1040152249 |
11 | 494158864 |
12 | 250417b61 |
13 | 137658106 |
14 | 9c200333 |
15 | 614b33d4 |
hex | 3dff76b9 |
1040152249 has 2 divisors, whose sum is σ = 1040152250. Its totient is φ = 1040152248.
The previous prime is 1040152219. The next prime is 1040152277. The reversal of 1040152249 is 9422510401.
It is an a-pointer prime, because the next prime (1040152277) can be obtained adding 1040152249 to its sum of digits (28).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 911738025 + 128414224 = 30195^2 + 11332^2 .
It is a cyclic number.
It is not a de Polignac number, because 1040152249 - 211 = 1040150201 is a prime.
It is not a weakly prime, because it can be changed into another prime (1040152219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520076124 + 520076125.
It is an arithmetic number, because the mean of its divisors is an integer number (520076125).
Almost surely, 21040152249 is an apocalyptic number.
It is an amenable number.
1040152249 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040152249 is an equidigital number, since it uses as much as digits as its factorization.
1040152249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2880, while the sum is 28.
The square root of 1040152249 is about 32251.3914273478. The cubic root of 1040152249 is about 1013.2088413136.
It can be divided in two parts, 1040152 and 249, that added together give a palindrome (1040401).
The spelling of 1040152249 in words is "one billion, forty million, one hundred fifty-two thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •