Base | Representation |
---|---|
bin | 110001001011011100… |
… | …0000101101110011011 |
3 | 101002121011210022202202 |
4 | 1202112320011232123 |
5 | 3212242242013034 |
6 | 120303343320415 |
7 | 10426061306222 |
oct | 1422670055633 |
9 | 332534708682 |
10 | 105610501019 |
11 | 40875413601 |
12 | 185748b010b |
13 | 9c60ca282a |
14 | 517c23dcb9 |
15 | 2b31a8547e |
hex | 1896e05b9b |
105610501019 has 2 divisors, whose sum is σ = 105610501020. Its totient is φ = 105610501018.
The previous prime is 105610501013. The next prime is 105610501057. The reversal of 105610501019 is 910105016501.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 105610501019 - 28 = 105610500763 is a prime.
It is a super-2 number, since 2×1056105010192 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 105610500982 and 105610501000.
It is not a weakly prime, because it can be changed into another prime (105610501013) 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, 52805250509 + 52805250510.
It is an arithmetic number, because the mean of its divisors is an integer number (52805250510).
Almost surely, 2105610501019 is an apocalyptic number.
105610501019 is a deficient number, since it is larger than the sum of its proper divisors (1).
105610501019 is an equidigital number, since it uses as much as digits as its factorization.
105610501019 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1350, while the sum is 29.
The spelling of 105610501019 in words is "one hundred five billion, six hundred ten million, five hundred one thousand, nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •