Base | Representation |
---|---|
bin | 10100000010100… |
… | …000110110001101 |
3 | 212102121220000111 |
4 | 110002200312031 |
5 | 1142032000044 |
6 | 53210000021 |
7 | 11221452052 |
oct | 2402406615 |
9 | 772556014 |
10 | 336203149 |
11 | 162861447 |
12 | 94716011 |
13 | 54865399 |
14 | 32919029 |
15 | 1e7b0b34 |
hex | 140a0d8d |
336203149 has 2 divisors, whose sum is σ = 336203150. Its totient is φ = 336203148.
The previous prime is 336203093. The next prime is 336203171. The reversal of 336203149 is 941302633.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 195021225 + 141181924 = 13965^2 + 11882^2 .
It is a cyclic number.
It is not a de Polignac number, because 336203149 - 215 = 336170381 is a prime.
It is a super-2 number, since 2×3362031492 = 226065114795032402, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 336203149.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (336203249) 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, 168101574 + 168101575.
It is an arithmetic number, because the mean of its divisors is an integer number (168101575).
Almost surely, 2336203149 is an apocalyptic number.
It is an amenable number.
336203149 is a deficient number, since it is larger than the sum of its proper divisors (1).
336203149 is an equidigital number, since it uses as much as digits as its factorization.
336203149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11664, while the sum is 31.
The square root of 336203149 is about 18335.8432857614. The cubic root of 336203149 is about 695.3454101418.
The spelling of 336203149 in words is "three hundred thirty-six million, two hundred three thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •