Base | Representation |
---|---|
bin | 101111111110111010… |
… | …0010110010000101111 |
3 | 100211222012211202012112 |
4 | 1133331310112100233 |
5 | 3142012401344002 |
6 | 115200452354235 |
7 | 10305330462206 |
oct | 1377564262057 |
9 | 324865752175 |
10 | 103042606127 |
11 | 3a77795711a |
12 | 17b7891597b |
13 | 9941c90ab6 |
14 | 4db719823d |
15 | 2a313e7852 |
hex | 17fdd1642f |
103042606127 has 2 divisors, whose sum is σ = 103042606128. Its totient is φ = 103042606126.
The previous prime is 103042606109. The next prime is 103042606129. The reversal of 103042606127 is 721606240301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 103042606127 - 210 = 103042605103 is a prime.
Together with 103042606129, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 103042606093 and 103042606102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (103042606129) 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, 51521303063 + 51521303064.
It is an arithmetic number, because the mean of its divisors is an integer number (51521303064).
Almost surely, 2103042606127 is an apocalyptic number.
103042606127 is a deficient number, since it is larger than the sum of its proper divisors (1).
103042606127 is an equidigital number, since it uses as much as digits as its factorization.
103042606127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12096, while the sum is 32.
Adding to 103042606127 its reverse (721606240301), we get a palindrome (824648846428).
The spelling of 103042606127 in words is "one hundred three billion, forty-two million, six hundred six thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •