Base | Representation |
---|---|
bin | 1100011100010111… |
… | …1100001011101001 |
3 | 22121210012220211201 |
4 | 3013011330023221 |
5 | 23320044120314 |
6 | 1311240324201 |
7 | 145526300041 |
oct | 30705741351 |
9 | 8553186751 |
10 | 3340223209 |
11 | 1464518154 |
12 | 792773661 |
13 | 41302664b |
14 | 23988a721 |
15 | 14839ab74 |
hex | c717c2e9 |
3340223209 has 2 divisors, whose sum is σ = 3340223210. Its totient is φ = 3340223208.
The previous prime is 3340223129. The next prime is 3340223233. The reversal of 3340223209 is 9023220433.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3105275625 + 234947584 = 55725^2 + 15328^2 .
It is an emirp because it is prime and its reverse (9023220433) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3340223209 - 223 = 3331834601 is a prime.
It is a super-2 number, since 2×33402232092 = 22314182171884515362, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3340223239) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1670111604 + 1670111605.
It is an arithmetic number, because the mean of its divisors is an integer number (1670111605).
Almost surely, 23340223209 is an apocalyptic number.
It is an amenable number.
3340223209 is a deficient number, since it is larger than the sum of its proper divisors (1).
3340223209 is an equidigital number, since it uses as much as digits as its factorization.
3340223209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 7776, while the sum is 28.
The square root of 3340223209 is about 57794.6641914286. The cubic root of 3340223209 is about 1494.8300846027.
The spelling of 3340223209 in words is "three billion, three hundred forty million, two hundred twenty-three thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •