Base | Representation |
---|---|
bin | 10000100111000… |
… | …10101101000001 |
3 | 100201012020101022 |
4 | 20103202231001 |
5 | 241132344414 |
6 | 21454315225 |
7 | 3311242562 |
oct | 1023425501 |
9 | 321166338 |
10 | 139340609 |
11 | 71721731 |
12 | 3a7b8b15 |
13 | 22b39185 |
14 | 14712169 |
15 | c37618e |
hex | 84e2b41 |
139340609 has 2 divisors, whose sum is σ = 139340610. Its totient is φ = 139340608.
The previous prime is 139340599. The next prime is 139340611. The reversal of 139340609 is 906043931.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 105001009 + 34339600 = 10247^2 + 5860^2 .
It is a cyclic number.
It is not a de Polignac number, because 139340609 - 28 = 139340353 is a prime.
It is a Sophie Germain prime.
Together with 139340611, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (139340659) 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, 69670304 + 69670305.
It is an arithmetic number, because the mean of its divisors is an integer number (69670305).
Almost surely, 2139340609 is an apocalyptic number.
It is an amenable number.
139340609 is a deficient number, since it is larger than the sum of its proper divisors (1).
139340609 is an equidigital number, since it uses as much as digits as its factorization.
139340609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17496, while the sum is 35.
The square root of 139340609 is about 11804.2623234152. The cubic root of 139340609 is about 518.4329165155.
The spelling of 139340609 in words is "one hundred thirty-nine million, three hundred forty thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •