Base | Representation |
---|---|
bin | 111011111010010… |
… | …101111100101001 |
3 | 2121001100220120112 |
4 | 323322111330221 |
5 | 4024304244433 |
6 | 243423504105 |
7 | 33623430311 |
oct | 7372257451 |
9 | 2531326515 |
10 | 1005149993 |
11 | 476421081 |
12 | 240758035 |
13 | 130321313 |
14 | 976cc441 |
15 | 5d39c348 |
hex | 3be95f29 |
1005149993 has 2 divisors, whose sum is σ = 1005149994. Its totient is φ = 1005149992.
The previous prime is 1005149963. The next prime is 1005150001. The reversal of 1005149993 is 3999415001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 733163929 + 271986064 = 27077^2 + 16492^2 .
It is an emirp because it is prime and its reverse (3999415001) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1005149993 - 226 = 938041129 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1005149993.
It is not a weakly prime, because it can be changed into another prime (1005149923) 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, 502574996 + 502574997.
It is an arithmetic number, because the mean of its divisors is an integer number (502574997).
Almost surely, 21005149993 is an apocalyptic number.
It is an amenable number.
1005149993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1005149993 is an equidigital number, since it uses as much as digits as its factorization.
1005149993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 41.
The square root of 1005149993 is about 31704.1005707464. The cubic root of 1005149993 is about 1001.7137257996.
The spelling of 1005149993 in words is "one billion, five million, one hundred forty-nine thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •