Base | Representation |
---|---|
bin | 10100000100010… |
… | …100011100101001 |
3 | 212110111221112112 |
4 | 110010110130221 |
5 | 1142142123044 |
6 | 53224052105 |
7 | 11225463401 |
oct | 2404243451 |
9 | 773457475 |
10 | 336676649 |
11 | 163055171 |
12 | 94904035 |
13 | 5499ca6a |
14 | 329dd801 |
15 | 1e85609e |
hex | 14114729 |
336676649 has 2 divisors, whose sum is σ = 336676650. Its totient is φ = 336676648.
The previous prime is 336676643. The next prime is 336676661. The reversal of 336676649 is 946676633.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 322561600 + 14115049 = 17960^2 + 3757^2 .
It is a cyclic number.
It is not a de Polignac number, because 336676649 - 228 = 68241193 is a prime.
It is a super-2 number, since 2×3366766492 = 226702331963738402, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 336676597 and 336676606.
It is not a weakly prime, because it can be changed into another prime (336676643) 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, 168338324 + 168338325.
It is an arithmetic number, because the mean of its divisors is an integer number (168338325).
Almost surely, 2336676649 is an apocalyptic number.
It is an amenable number.
336676649 is a deficient number, since it is larger than the sum of its proper divisors (1).
336676649 is an equidigital number, since it uses as much as digits as its factorization.
336676649 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2939328, while the sum is 50.
The square root of 336676649 is about 18348.7506114177. The cubic root of 336676649 is about 695.6716926352.
The spelling of 336676649 in words is "three hundred thirty-six million, six hundred seventy-six thousand, six hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •