Base | Representation |
---|---|
bin | 110000010010111100… |
… | …1110110001000101111 |
3 | 100220201002022210211002 |
4 | 1200211321312020233 |
5 | 3144402033323142 |
6 | 115351315150515 |
7 | 10331105052635 |
oct | 1404571661057 |
9 | 326632283732 |
10 | 103715136047 |
11 | 3aa92543876 |
12 | 18125ba543b |
13 | 9a1b4028b3 |
14 | 503c621355 |
15 | 2a70490a32 |
hex | 1825e7622f |
103715136047 has 2 divisors, whose sum is σ = 103715136048. Its totient is φ = 103715136046.
The previous prime is 103715135977. The next prime is 103715136053. The reversal of 103715136047 is 740631517301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103715136047 - 220 = 103714087471 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 103715136047.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103715136247) 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, 51857568023 + 51857568024.
It is an arithmetic number, because the mean of its divisors is an integer number (51857568024).
Almost surely, 2103715136047 is an apocalyptic number.
103715136047 is a deficient number, since it is larger than the sum of its proper divisors (1).
103715136047 is an equidigital number, since it uses as much as digits as its factorization.
103715136047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 52920, while the sum is 38.
The spelling of 103715136047 in words is "one hundred three billion, seven hundred fifteen million, one hundred thirty-six thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •