Base | Representation |
---|---|
bin | 111110011010110… |
… | …110001100111101 |
3 | 2200222112112211122 |
4 | 332122312030331 |
5 | 4121042201044 |
6 | 251525400325 |
7 | 34644160355 |
oct | 7632661475 |
9 | 2628475748 |
10 | 1047225149 |
11 | 498149833 |
12 | 2528690a5 |
13 | 138c63569 |
14 | 9d121b65 |
15 | 61e0ddee |
hex | 3e6b633d |
1047225149 has 2 divisors, whose sum is σ = 1047225150. Its totient is φ = 1047225148.
The previous prime is 1047225017. The next prime is 1047225163. The reversal of 1047225149 is 9415227401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 641001124 + 406224025 = 25318^2 + 20155^2 .
It is an emirp because it is prime and its reverse (9415227401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1047225149 - 216 = 1047159613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1047225349) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 523612574 + 523612575.
It is an arithmetic number, because the mean of its divisors is an integer number (523612575).
Almost surely, 21047225149 is an apocalyptic number.
It is an amenable number.
1047225149 is a deficient number, since it is larger than the sum of its proper divisors (1).
1047225149 is an equidigital number, since it uses as much as digits as its factorization.
1047225149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20160, while the sum is 35.
The square root of 1047225149 is about 32360.8582858984. The cubic root of 1047225149 is about 1015.5002182242.
The spelling of 1047225149 in words is "one billion, forty-seven million, two hundred twenty-five thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •