Base | Representation |
---|---|
bin | 10000100011000… |
… | …11101000011111 |
3 | 100200012210102012 |
4 | 20101203220133 |
5 | 241014221002 |
6 | 21435221435 |
7 | 3303644255 |
oct | 1021435037 |
9 | 320183365 |
10 | 138820127 |
11 | 713a6686 |
12 | 3a5a787b |
13 | 229b62b4 |
14 | 146185d5 |
15 | c2c1d52 |
hex | 8463a1f |
138820127 has 2 divisors, whose sum is σ = 138820128. Its totient is φ = 138820126.
The previous prime is 138820109. The next prime is 138820133. The reversal of 138820127 is 721028831.
It is a strong prime.
It is an emirp because it is prime and its reverse (721028831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 138820127 - 26 = 138820063 is a prime.
It is a super-2 number, since 2×1388201272 = 38542055320592258, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 138820093 and 138820102.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138820027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69410063 + 69410064.
It is an arithmetic number, because the mean of its divisors is an integer number (69410064).
Almost surely, 2138820127 is an apocalyptic number.
138820127 is a deficient number, since it is larger than the sum of its proper divisors (1).
138820127 is an equidigital number, since it uses as much as digits as its factorization.
138820127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5376, while the sum is 32.
The square root of 138820127 is about 11782.1953387304. The cubic root of 138820127 is about 517.7866065473.
Adding to 138820127 its reverse (721028831), we get a palindrome (859848958).
The spelling of 138820127 in words is "one hundred thirty-eight million, eight hundred twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •