Base | Representation |
---|---|
bin | 110000011010101101… |
… | …1111000101111101111 |
3 | 100221101020122201212202 |
4 | 1200311123320233233 |
5 | 3200420240432441 |
6 | 115433224252115 |
7 | 10340421006464 |
oct | 1406533705757 |
9 | 327336581782 |
10 | 103975717871 |
11 | 40106644853 |
12 | 1819931103b |
13 | 9a603ab91c |
14 | 506509366b |
15 | 2a882b519b |
hex | 18356f8bef |
103975717871 has 2 divisors, whose sum is σ = 103975717872. Its totient is φ = 103975717870.
The previous prime is 103975717829. The next prime is 103975717873. The reversal of 103975717871 is 178717579301.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-103975717871 is a prime.
Together with 103975717873, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103975717873) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51987858935 + 51987858936.
It is an arithmetic number, because the mean of its divisors is an integer number (51987858936).
Almost surely, 2103975717871 is an apocalyptic number.
103975717871 is a deficient number, since it is larger than the sum of its proper divisors (1).
103975717871 is an equidigital number, since it uses as much as digits as its factorization.
103975717871 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2593080, while the sum is 56.
The spelling of 103975717871 in words is "one hundred three billion, nine hundred seventy-five million, seven hundred seventeen thousand, eight hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •