Base | Representation |
---|---|
bin | 110001001010010110000… |
… | …101010001101110101001 |
3 | 102221222010212121120210201 |
4 | 301022112011101232221 |
5 | 420322341214313033 |
6 | 11103555335512201 |
7 | 466035652256131 |
oct | 61122605215651 |
9 | 12858125546721 |
10 | 3378362260393 |
11 | 109283447104a |
12 | 4668ba828661 |
13 | 1b67693a5b13 |
14 | b9729497ac1 |
15 | 5cd2b71a47d |
hex | 31296151ba9 |
3378362260393 has 2 divisors, whose sum is σ = 3378362260394. Its totient is φ = 3378362260392.
The previous prime is 3378362260331. The next prime is 3378362260409. The reversal of 3378362260393 is 3930622638733.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3236016025449 + 142346234944 = 1798893^2 + 377288^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-3378362260393 is a prime.
It is a super-2 number, since 2×33783622603932 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3378362260303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1689181130196 + 1689181130197.
It is an arithmetic number, because the mean of its divisors is an integer number (1689181130197).
Almost surely, 23378362260393 is an apocalyptic number.
It is an amenable number.
3378362260393 is a deficient number, since it is larger than the sum of its proper divisors (1).
3378362260393 is an equidigital number, since it uses as much as digits as its factorization.
3378362260393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17635968, while the sum is 55.
The spelling of 3378362260393 in words is "three trillion, three hundred seventy-eight billion, three hundred sixty-two million, two hundred sixty thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •