Base | Representation |
---|---|
bin | 110000100110101111011… |
… | …001001101011001001001 |
3 | 102211022110120000211001121 |
4 | 300212233121031121021 |
5 | 414211042321211444 |
6 | 11034234025115241 |
7 | 463213406225032 |
oct | 60465731153111 |
9 | 12738416024047 |
10 | 3340132210249 |
11 | 10785a661258a |
12 | 45b40b628b21 |
13 | 1b2c85c21883 |
14 | b793ddbda89 |
15 | 5bd40303084 |
hex | 309af64d649 |
3340132210249 has 2 divisors, whose sum is σ = 3340132210250. Its totient is φ = 3340132210248.
The previous prime is 3340132210139. The next prime is 3340132210273. The reversal of 3340132210249 is 9420122310433.
3340132210249 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2901316055625 + 438816154624 = 1703325^2 + 662432^2 .
It is a cyclic number.
It is not a de Polignac number, because 3340132210249 - 217 = 3340132079177 is a prime.
It is a super-2 number, since 2×33401322102492 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3340132217249) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1670066105124 + 1670066105125.
It is an arithmetic number, because the mean of its divisors is an integer number (1670066105125).
Almost surely, 23340132210249 is an apocalyptic number.
It is an amenable number.
3340132210249 is a deficient number, since it is larger than the sum of its proper divisors (1).
3340132210249 is an equidigital number, since it uses as much as digits as its factorization.
3340132210249 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 31104, while the sum is 34.
The spelling of 3340132210249 in words is "three trillion, three hundred forty billion, one hundred thirty-two million, two hundred ten thousand, two hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •