Base | Representation |
---|---|
bin | 10000011111011… |
… | …00001000110101 |
3 | 100122021221000102 |
4 | 20033230020311 |
5 | 240403040202 |
6 | 21420523445 |
7 | 3266535302 |
oct | 1017541065 |
9 | 318257012 |
10 | 138330677 |
11 | 710a1981 |
12 | 3a3b0585 |
13 | 22874594 |
14 | 1452c0a9 |
15 | c226d02 |
hex | 83ec235 |
138330677 has 2 divisors, whose sum is σ = 138330678. Its totient is φ = 138330676.
The previous prime is 138330641. The next prime is 138330707. The reversal of 138330677 is 776033831.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 107350321 + 30980356 = 10361^2 + 5566^2 .
It is an emirp because it is prime and its reverse (776033831) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 138330677 - 212 = 138326581 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 138330677.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (138330617) 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, 69165338 + 69165339.
It is an arithmetic number, because the mean of its divisors is an integer number (69165339).
Almost surely, 2138330677 is an apocalyptic number.
It is an amenable number.
138330677 is a deficient number, since it is larger than the sum of its proper divisors (1).
138330677 is an equidigital number, since it uses as much as digits as its factorization.
138330677 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 63504, while the sum is 38.
The square root of 138330677 is about 11761.4062509549. The cubic root of 138330677 is about 517.1773551075.
The spelling of 138330677 in words is "one hundred thirty-eight million, three hundred thirty thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •