Base | Representation |
---|---|
bin | 10000011101110… |
… | …01010110000011 |
3 | 100121220100121212 |
4 | 20032321112003 |
5 | 240324411002 |
6 | 21412240335 |
7 | 3265010606 |
oct | 1016712603 |
9 | 317810555 |
10 | 138122627 |
11 | 70a6a635 |
12 | 3a3100ab |
13 | 22800986 |
14 | 144b633d |
15 | c1d5352 |
hex | 83b9583 |
138122627 has 2 divisors, whose sum is σ = 138122628. Its totient is φ = 138122626.
The previous prime is 138122597. The next prime is 138122629. The reversal of 138122627 is 726221831.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 138122627 - 210 = 138121603 is a prime.
It is a super-2 number, since 2×1381226272 = 38155720178762258, which contains 22 as substring.
Together with 138122629, it forms a pair of twin primes.
It is a Chen prime.
It is equal to p7811951 and since 138122627 and 7811951 have the same sum of digits, it is a Honaker prime.
It is a junction number, because it is equal to n+sod(n) for n = 138122593 and 138122602.
It is not a weakly prime, because it can be changed into another prime (138122629) 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, 69061313 + 69061314.
It is an arithmetic number, because the mean of its divisors is an integer number (69061314).
Almost surely, 2138122627 is an apocalyptic number.
138122627 is a deficient number, since it is larger than the sum of its proper divisors (1).
138122627 is an equidigital number, since it uses as much as digits as its factorization.
138122627 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 8064, while the sum is 32.
The square root of 138122627 is about 11752.5583172346. The cubic root of 138122627 is about 516.9179459410.
The spelling of 138122627 in words is "one hundred thirty-eight million, one hundred twenty-two thousand, six hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •