Base | Representation |
---|---|
bin | 1100100001000110… |
… | …0101010010101001 |
3 | 22200011112100100221 |
4 | 3020101211102221 |
5 | 23340133134033 |
6 | 1313225330041 |
7 | 146156655055 |
oct | 31021452251 |
9 | 8604470327 |
10 | 3360052393 |
11 | 1474731105 |
12 | 799336921 |
13 | 41717a0a9 |
14 | 23c36cc65 |
15 | 149eb612d |
hex | c84654a9 |
3360052393 has 2 divisors, whose sum is σ = 3360052394. Its totient is φ = 3360052392.
The previous prime is 3360052373. The next prime is 3360052403. The reversal of 3360052393 is 3932500633.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2778133264 + 581919129 = 52708^2 + 24123^2 .
It is an emirp because it is prime and its reverse (3932500633) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3360052393 - 25 = 3360052361 is a prime.
It is a super-2 number, since 2×33600523932 = 22579904167410052898, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3360052303) 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, 1680026196 + 1680026197.
It is an arithmetic number, because the mean of its divisors is an integer number (1680026197).
Almost surely, 23360052393 is an apocalyptic number.
It is an amenable number.
3360052393 is a deficient number, since it is larger than the sum of its proper divisors (1).
3360052393 is an equidigital number, since it uses as much as digits as its factorization.
3360052393 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 43740, while the sum is 34.
The square root of 3360052393 is about 57965.9589155566. The cubic root of 3360052393 is about 1497.7822624130.
The spelling of 3360052393 in words is "three billion, three hundred sixty million, fifty-two thousand, three hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •