Base | Representation |
---|---|
bin | 10000100111000… |
… | …10010000111001 |
3 | 100201012010220122 |
4 | 20103202100321 |
5 | 241132320214 |
6 | 21454303025 |
7 | 3311234411 |
oct | 1023422071 |
9 | 321163818 |
10 | 139338809 |
11 | 71720345 |
12 | 3a7b7a75 |
13 | 22b383cc |
14 | 14711641 |
15 | c37588e |
hex | 84e2439 |
139338809 has 2 divisors, whose sum is σ = 139338810. Its totient is φ = 139338808.
The previous prime is 139338803. The next prime is 139338833. The reversal of 139338809 is 908833931.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 80048809 + 59290000 = 8947^2 + 7700^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-139338809 is a prime.
It is a Chen prime.
It is equal to p7876826 and since 139338809 and 7876826 have the same sum of digits, it is a Honaker prime.
It is a self number, because there is not a number n which added to its sum of digits gives 139338809.
It is not a weakly prime, because it can be changed into another prime (139338803) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 69669404 + 69669405.
It is an arithmetic number, because the mean of its divisors is an integer number (69669405).
Almost surely, 2139338809 is an apocalyptic number.
It is an amenable number.
139338809 is a deficient number, since it is larger than the sum of its proper divisors (1).
139338809 is an equidigital number, since it uses as much as digits as its factorization.
139338809 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 139968, while the sum is 44.
The square root of 139338809 is about 11804.1860795228. The cubic root of 139338809 is about 518.4306841362.
The spelling of 139338809 in words is "one hundred thirty-nine million, three hundred thirty-eight thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •