Base | Representation |
---|---|
bin | 1100100000000010… |
… | …0111110000100001 |
3 | 22122212011110010112 |
4 | 3020000213300201 |
5 | 23333013343144 |
6 | 1312550141105 |
7 | 146104116005 |
oct | 31000476041 |
9 | 8585143115 |
10 | 3355606049 |
11 | 1472174544 |
12 | 797951795 |
13 | 416281313 |
14 | 23b932705 |
15 | 1498d899e |
hex | c8027c21 |
3355606049 has 2 divisors, whose sum is σ = 3355606050. Its totient is φ = 3355606048.
The previous prime is 3355606043. The next prime is 3355606057. The reversal of 3355606049 is 9406065533.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2477550625 + 878055424 = 49775^2 + 29632^2 .
It is a cyclic number.
It is not a de Polignac number, because 3355606049 - 28 = 3355605793 is a prime.
It is a super-2 number, since 2×33556060492 = 22520183912170780802, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3355605997 and 3355606015.
It is not a weakly prime, because it can be changed into another prime (3355606043) 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, 1677803024 + 1677803025.
It is an arithmetic number, because the mean of its divisors is an integer number (1677803025).
Almost surely, 23355606049 is an apocalyptic number.
It is an amenable number.
3355606049 is a deficient number, since it is larger than the sum of its proper divisors (1).
3355606049 is an equidigital number, since it uses as much as digits as its factorization.
3355606049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 291600, while the sum is 41.
The square root of 3355606049 is about 57927.5931573201. The cubic root of 3355606049 is about 1497.1213010029.
The spelling of 3355606049 in words is "three billion, three hundred fifty-five million, six hundred six thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •