Base | Representation |
---|---|
bin | 10100010000001… |
… | …100100011010101 |
3 | 212200101010022012 |
4 | 110100030203111 |
5 | 1143441240122 |
6 | 53414514005 |
7 | 11264111336 |
oct | 2420144325 |
9 | 780333265 |
10 | 339790037 |
11 | 164891314 |
12 | 95965905 |
13 | 5551cbc2 |
14 | 331b028d |
15 | 1ec6d7e2 |
hex | 1440c8d5 |
339790037 has 2 divisors, whose sum is σ = 339790038. Its totient is φ = 339790036.
The previous prime is 339790021. The next prime is 339790079. The reversal of 339790037 is 730097933.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 338044996 + 1745041 = 18386^2 + 1321^2 .
It is a cyclic number.
It is not a de Polignac number, because 339790037 - 24 = 339790021 is a prime.
It is a super-2 number, since 2×3397900372 = 230914538488922738, which contains 22 as substring.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 339789976 and 339790003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (339790097) 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, 169895018 + 169895019.
It is an arithmetic number, because the mean of its divisors is an integer number (169895019).
Almost surely, 2339790037 is an apocalyptic number.
It is an amenable number.
339790037 is a deficient number, since it is larger than the sum of its proper divisors (1).
339790037 is an equidigital number, since it uses as much as digits as its factorization.
339790037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 107163, while the sum is 41.
The square root of 339790037 is about 18433.3946141236. The cubic root of 339790037 is about 697.8095041765.
The spelling of 339790037 in words is "three hundred thirty-nine million, seven hundred ninety thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •