Base | Representation |
---|---|
bin | 111110100110010… |
… | …110011110110101 |
3 | 2201012012202201221 |
4 | 332212112132311 |
5 | 4122330202244 |
6 | 252114150341 |
7 | 35011620652 |
oct | 7646263665 |
9 | 2635182657 |
10 | 1050240949 |
11 | 49991962a |
12 | 2538823b1 |
13 | 13977b164 |
14 | 9d6a8c29 |
15 | 62307784 |
hex | 3e9967b5 |
1050240949 has 2 divisors, whose sum is σ = 1050240950. Its totient is φ = 1050240948.
The previous prime is 1050240937. The next prime is 1050241009. The reversal of 1050240949 is 9490420501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 755260324 + 294980625 = 27482^2 + 17175^2 .
It is an emirp because it is prime and its reverse (9490420501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1050240949 - 229 = 513370037 is a prime.
It is a super-2 number, since 2×10502409492 = 2206012101912841202, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050240349) 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, 525120474 + 525120475.
It is an arithmetic number, because the mean of its divisors is an integer number (525120475).
Almost surely, 21050240949 is an apocalyptic number.
It is an amenable number.
1050240949 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050240949 is an equidigital number, since it uses as much as digits as its factorization.
1050240949 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12960, while the sum is 34.
The square root of 1050240949 is about 32407.4212025579. The cubic root of 1050240949 is about 1016.4740968007.
The spelling of 1050240949 in words is "one billion, fifty million, two hundred forty thousand, nine hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •