Base | Representation |
---|---|
bin | 1100100001100110… |
… | …0101111011001011 |
3 | 22200022111000200022 |
4 | 3020121211323023 |
5 | 23341202332024 |
6 | 1313342331055 |
7 | 146213551553 |
oct | 31031457313 |
9 | 8608430608 |
10 | 3362152139 |
11 | 1475935735 |
12 | 799b89a8b |
13 | 417733a48 |
14 | 23c758163 |
15 | 14a27d35e |
hex | c8665ecb |
3362152139 has 2 divisors, whose sum is σ = 3362152140. Its totient is φ = 3362152138.
The previous prime is 3362152117. The next prime is 3362152147. The reversal of 3362152139 is 9312512633.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 3362152139 - 28 = 3362151883 is a prime.
It is a super-2 number, since 2×33621521392 = 22608134011564550642, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3362152099 and 3362152108.
It is not a weakly prime, because it can be changed into another prime (3362152639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1681076069 + 1681076070.
It is an arithmetic number, because the mean of its divisors is an integer number (1681076070).
Almost surely, 23362152139 is an apocalyptic number.
3362152139 is a deficient number, since it is larger than the sum of its proper divisors (1).
3362152139 is an equidigital number, since it uses as much as digits as its factorization.
3362152139 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 29160, while the sum is 35.
The square root of 3362152139 is about 57984.0679756086. The cubic root of 3362152139 is about 1498.0941928100.
The spelling of 3362152139 in words is "three billion, three hundred sixty-two million, one hundred fifty-two thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •