Base | Representation |
---|---|
bin | 110000111001011001… |
… | …0100001111100111001 |
3 | 101001000222112221022012 |
4 | 1201302302201330321 |
5 | 3210022244021433 |
6 | 120123314535305 |
7 | 10405060213544 |
oct | 1416262417471 |
9 | 331028487265 |
10 | 105005063993 |
11 | 40594691825 |
12 | 18425b97535 |
13 | 9b9572227b |
14 | 5121a7d85b |
15 | 2ae8841848 |
hex | 1872ca1f39 |
105005063993 has 2 divisors, whose sum is σ = 105005063994. Its totient is φ = 105005063992.
The previous prime is 105005063983. The next prime is 105005064029. The reversal of 105005063993 is 399360500501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 93763339264 + 11241724729 = 306208^2 + 106027^2 .
It is a cyclic number.
It is not a de Polignac number, because 105005063993 - 210 = 105005062969 is a prime.
It is a super-2 number, since 2×1050050639932 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105005063993.
It is not a weakly prime, because it can be changed into another prime (105005063923) 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, 52502531996 + 52502531997.
It is an arithmetic number, because the mean of its divisors is an integer number (52502531997).
Almost surely, 2105005063993 is an apocalyptic number.
It is an amenable number.
105005063993 is a deficient number, since it is larger than the sum of its proper divisors (1).
105005063993 is an equidigital number, since it uses as much as digits as its factorization.
105005063993 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 109350, while the sum is 41.
The spelling of 105005063993 in words is "one hundred five billion, five million, sixty-three thousand, nine hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •