Base | Representation |
---|---|
bin | 1100011001111011… |
… | …1100010010110001 |
3 | 22121001222112022011 |
4 | 3012132330102301 |
5 | 23304440000144 |
6 | 1310233242521 |
7 | 145343350645 |
oct | 30636742261 |
9 | 8531875264 |
10 | 3330000049 |
11 | 1459775362 |
12 | 78b263441 |
13 | 410b8733c |
14 | 238388c25 |
15 | 14752ba34 |
hex | c67bc4b1 |
3330000049 has 2 divisors, whose sum is σ = 3330000050. Its totient is φ = 3330000048.
The previous prime is 3330000043. The next prime is 3330000127. The reversal of 3330000049 is 9400000333.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1730560000 + 1599440049 = 41600^2 + 39993^2 .
It is a cyclic number.
It is not a de Polignac number, because 3330000049 - 23 = 3330000041 is a prime.
It is a super-2 number, since 2×33300000492 = 22177800652680004802, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3329999984 and 3330000029.
It is not a weakly prime, because it can be changed into another prime (3330000041) 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, 1665000024 + 1665000025.
It is an arithmetic number, because the mean of its divisors is an integer number (1665000025).
Almost surely, 23330000049 is an apocalyptic number.
It is an amenable number.
3330000049 is a deficient number, since it is larger than the sum of its proper divisors (1).
3330000049 is an equidigital number, since it uses as much as digits as its factorization.
3330000049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 972, while the sum is 22.
The square root of 3330000049 is about 57706.1526095788. The cubic root of 3330000049 is about 1493.3034895793.
The spelling of 3330000049 in words is "three billion, three hundred thirty million, forty-nine", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •