Base | Representation |
---|---|
bin | 1100010110000001… |
… | …1100100010011001 |
3 | 22112221011012001101 |
4 | 3011200130202121 |
5 | 23241241221144 |
6 | 1304450151401 |
7 | 145054165051 |
oct | 30540344231 |
9 | 8487135041 |
10 | 3313617049 |
11 | 14504a5596 |
12 | 785882561 |
13 | 40a66c362 |
14 | 236122561 |
15 | 145d926d4 |
hex | c581c899 |
3313617049 has 2 divisors, whose sum is σ = 3313617050. Its totient is φ = 3313617048.
The previous prime is 3313617019. The next prime is 3313617079. The reversal of 3313617049 is 9407163133.
It is a balanced prime because it is at equal distance from previous prime (3313617019) and next prime (3313617079).
It can be written as a sum of positive squares in only one way, i.e., 3283290000 + 30327049 = 57300^2 + 5507^2 .
It is a cyclic number.
It is not a de Polignac number, because 3313617049 - 27 = 3313616921 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3313616999 and 3313617017.
It is not a weakly prime, because it can be changed into another prime (3313617019) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1656808524 + 1656808525.
It is an arithmetic number, because the mean of its divisors is an integer number (1656808525).
Almost surely, 23313617049 is an apocalyptic number.
It is an amenable number.
3313617049 is a deficient number, since it is larger than the sum of its proper divisors (1).
3313617049 is an equidigital number, since it uses as much as digits as its factorization.
3313617049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 40824, while the sum is 37.
The square root of 3313617049 is about 57564.0256497059. The cubic root of 3313617049 is about 1490.8505344725.
The spelling of 3313617049 in words is "three billion, three hundred thirteen million, six hundred seventeen thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •