Base | Representation |
---|---|
bin | 1100011111010000… |
… | …1010101010010111 |
3 | 22122122000120112002 |
4 | 3013310022222113 |
5 | 23331144404033 |
6 | 1312352145515 |
7 | 146034300224 |
oct | 30764125227 |
9 | 8578016462 |
10 | 3352341143 |
11 | 1470344578 |
12 | 79683829b |
13 | 4156aa218 |
14 | 23b32294b |
15 | 1494913e8 |
hex | c7d0aa97 |
3352341143 has 2 divisors, whose sum is σ = 3352341144. Its totient is φ = 3352341142.
The previous prime is 3352341073. The next prime is 3352341227. The reversal of 3352341143 is 3411432533.
It is a weak prime.
It is an emirp because it is prime and its reverse (3411432533) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 3352341143 - 228 = 3083905687 is a prime.
It is a super-2 number, since 2×33523411432 = 22476382278101092898, which contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3352341943) 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, 1676170571 + 1676170572.
It is an arithmetic number, because the mean of its divisors is an integer number (1676170572).
Almost surely, 23352341143 is an apocalyptic number.
3352341143 is a deficient number, since it is larger than the sum of its proper divisors (1).
3352341143 is an equidigital number, since it uses as much as digits as its factorization.
3352341143 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 12960, while the sum is 29.
The square root of 3352341143 is about 57899.4053769121. The cubic root of 3352341143 is about 1496.6355917764.
Adding to 3352341143 its reverse (3411432533), we get a palindrome (6763773676).
The spelling of 3352341143 in words is "three billion, three hundred fifty-two million, three hundred forty-one thousand, one hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •