Base | Representation |
---|---|
bin | 110001001000010011… |
… | …1111100011111100111 |
3 | 101002022212102002022111 |
4 | 1202100213330133213 |
5 | 3212033413334412 |
6 | 120245115141451 |
7 | 10423345564543 |
oct | 1422047743747 |
9 | 332285362274 |
10 | 105505605607 |
11 | 40821189086 |
12 | 18545744887 |
13 | 9c45336a3c |
14 | 516c336a23 |
15 | 2b277652a7 |
hex | 18909fc7e7 |
105505605607 has 2 divisors, whose sum is σ = 105505605608. Its totient is φ = 105505605606.
The previous prime is 105505605587. The next prime is 105505605613. The reversal of 105505605607 is 706506505501.
It is a strong prime.
It is an emirp because it is prime and its reverse (706506505501) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 105505605607 - 227 = 105371387879 is a prime.
It is a super-2 number, since 2×1055056056072 (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 105505605607.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (105505635607) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52752802803 + 52752802804.
It is an arithmetic number, because the mean of its divisors is an integer number (52752802804).
Almost surely, 2105505605607 is an apocalyptic number.
105505605607 is a deficient number, since it is larger than the sum of its proper divisors (1).
105505605607 is an equidigital number, since it uses as much as digits as its factorization.
105505605607 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 157500, while the sum is 40.
The spelling of 105505605607 in words is "one hundred five billion, five hundred five million, six hundred five thousand, six hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •