Base | Representation |
---|---|
bin | 11110100100101111010… |
… | …00100010010001101001 |
3 | 10201102120021012102020222 |
4 | 33102113220202101221 |
5 | 114202424044142433 |
6 | 2122333403455425 |
7 | 135616523501306 |
oct | 17222750422151 |
9 | 3642507172228 |
10 | 1050516005993 |
11 | 375580997983 |
12 | 14b71b827575 |
13 | 780a8c05b4c |
14 | 38bb94d80ad |
15 | 1c4d6586b98 |
hex | f497a22469 |
1050516005993 has 2 divisors, whose sum is σ = 1050516005994. Its totient is φ = 1050516005992.
The previous prime is 1050516005977. The next prime is 1050516006017. The reversal of 1050516005993 is 3995006150501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1012814793769 + 37701212224 = 1006387^2 + 194168^2 .
It is a cyclic number.
It is not a de Polignac number, because 1050516005993 - 24 = 1050516005977 is a prime.
It is a super-2 number, since 2×10505160059932 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1050516005953) 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, 525258002996 + 525258002997.
It is an arithmetic number, because the mean of its divisors is an integer number (525258002997).
Almost surely, 21050516005993 is an apocalyptic number.
It is an amenable number.
1050516005993 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050516005993 is an equidigital number, since it uses as much as digits as its factorization.
1050516005993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 182250, while the sum is 44.
The spelling of 1050516005993 in words is "one trillion, fifty billion, five hundred sixteen million, five thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •