Base | Representation |
---|---|
bin | 10100000010100… |
… | …101001011001001 |
3 | 212102122210022221 |
4 | 110002211023021 |
5 | 1142033031443 |
6 | 53210214041 |
7 | 11221554532 |
oct | 2402451311 |
9 | 772583287 |
10 | 336220873 |
11 | 16287379a |
12 | 94724321 |
13 | 54870481 |
14 | 32921689 |
15 | 1e7b5eed |
hex | 140a52c9 |
336220873 has 2 divisors, whose sum is σ = 336220874. Its totient is φ = 336220872.
The previous prime is 336220783. The next prime is 336220901. The reversal of 336220873 is 378022633.
Together with previous prime (336220783) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 219839929 + 116380944 = 14827^2 + 10788^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-336220873 is a prime.
It is a super-2 number, since 2×3362208732 = 226088950881764258, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (336223873) 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, 168110436 + 168110437.
It is an arithmetic number, because the mean of its divisors is an integer number (168110437).
Almost surely, 2336220873 is an apocalyptic number.
It is an amenable number.
336220873 is a deficient number, since it is larger than the sum of its proper divisors (1).
336220873 is an equidigital number, since it uses as much as digits as its factorization.
336220873 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 36288, while the sum is 34.
The square root of 336220873 is about 18336.3265950408. The cubic root of 336220873 is about 695.3576290294.
The spelling of 336220873 in words is "three hundred thirty-six million, two hundred twenty thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.042 sec. • engine limits •