Base | Representation |
---|---|
bin | 1100011101000100… |
… | …0010001010110001 |
3 | 22121222200200000021 |
4 | 3013101002022301 |
5 | 23321320200223 |
6 | 1311422523441 |
7 | 145563101344 |
oct | 30721021261 |
9 | 8558620007 |
10 | 3343131313 |
11 | 1466124045 |
12 | 793736581 |
13 | 413804212 |
14 | 23a00645b |
15 | 14877265d |
hex | c74422b1 |
3343131313 has 2 divisors, whose sum is σ = 3343131314. Its totient is φ = 3343131312.
The previous prime is 3343131307. The next prime is 3343131317. The reversal of 3343131313 is 3131313433.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2656062369 + 687068944 = 51537^2 + 26212^2 .
It is a cyclic number.
It is not a de Polignac number, because 3343131313 - 221 = 3341034161 is a prime.
It is a super-2 number, since 2×33431313132 = 22353053951922207938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3343131317) 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, 1671565656 + 1671565657.
It is an arithmetic number, because the mean of its divisors is an integer number (1671565657).
Almost surely, 23343131313 is an apocalyptic number.
It is an amenable number.
3343131313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3343131313 is an equidigital number, since it uses as much as digits as its factorization.
3343131313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2916, while the sum is 25.
The square root of 3343131313 is about 57819.8176493147. The cubic root of 3343131313 is about 1495.2637742202.
Adding to 3343131313 its reverse (3131313433), we get a palindrome (6474444746).
The spelling of 3343131313 in words is "three billion, three hundred forty-three million, one hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •