Base | Representation |
---|---|
bin | 110000111001111111001… |
… | …011110100010000101101 |
3 | 102220021210210210101000211 |
4 | 300321333023310100231 |
5 | 420030403321321144 |
6 | 11051532425422421 |
7 | 464544466415125 |
oct | 60717713642055 |
9 | 12807723711024 |
10 | 3360798229549 |
11 | 1086340a91782 |
12 | 46341863aa11 |
13 | 1b4bca59ba67 |
14 | b8940915c85 |
15 | 5c64e77d034 |
hex | 30e7f2f442d |
3360798229549 has 2 divisors, whose sum is σ = 3360798229550. Its totient is φ = 3360798229548.
The previous prime is 3360798229489. The next prime is 3360798229553. The reversal of 3360798229549 is 9459228970633.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3111367904649 + 249430324900 = 1763907^2 + 499430^2 .
It is a cyclic number.
It is not a de Polignac number, because 3360798229549 - 29 = 3360798229037 is a prime.
It is a super-2 number, since 2×33607982295492 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3360798229049) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1680399114774 + 1680399114775.
It is an arithmetic number, because the mean of its divisors is an integer number (1680399114775).
Almost surely, 23360798229549 is an apocalyptic number.
It is an amenable number.
3360798229549 is a deficient number, since it is larger than the sum of its proper divisors (1).
3360798229549 is an equidigital number, since it uses as much as digits as its factorization.
3360798229549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 176359680, while the sum is 67.
The spelling of 3360798229549 in words is "three trillion, three hundred sixty billion, seven hundred ninety-eight million, two hundred twenty-nine thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •