Base | Representation |
---|---|
bin | 10100001111100… |
… | …000010111010001 |
3 | 212200000221000122 |
4 | 110033200113101 |
5 | 1143414442131 |
6 | 53411000025 |
7 | 11262425552 |
oct | 2417402721 |
9 | 780027018 |
10 | 339609041 |
11 | 164778332 |
12 | 95899015 |
13 | 554886c5 |
14 | 33164329 |
15 | 1ec34d7b |
hex | 143e05d1 |
339609041 has 2 divisors, whose sum is σ = 339609042. Its totient is φ = 339609040.
The previous prime is 339609037. The next prime is 339609043. The reversal of 339609041 is 140906933.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 219158416 + 120450625 = 14804^2 + 10975^2 .
It is an emirp because it is prime and its reverse (140906933) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 339609041 - 22 = 339609037 is a prime.
Together with 339609043, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 339608992 and 339609010.
It is not a weakly prime, because it can be changed into another prime (339609043) 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, 169804520 + 169804521.
It is an arithmetic number, because the mean of its divisors is an integer number (169804521).
Almost surely, 2339609041 is an apocalyptic number.
It is an amenable number.
339609041 is a deficient number, since it is larger than the sum of its proper divisors (1).
339609041 is an equidigital number, since it uses as much as digits as its factorization.
339609041 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 339609041 is about 18428.4845009024. The cubic root of 339609041 is about 697.6855814130.
The spelling of 339609041 in words is "three hundred thirty-nine million, six hundred nine thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •