Base | Representation |
---|---|
bin | 1100010111110100… |
… | …1010001111111001 |
3 | 22120110022121111221 |
4 | 3011331022033321 |
5 | 23300203104223 |
6 | 1305315352041 |
7 | 145205155324 |
oct | 30575121771 |
9 | 8513277457 |
10 | 3321144313 |
11 | 1454776973 |
12 | 7882b2621 |
13 | 40c0a6566 |
14 | 2371217bb |
15 | 14687cb5d |
hex | c5f4a3f9 |
3321144313 has 2 divisors, whose sum is σ = 3321144314. Its totient is φ = 3321144312.
The previous prime is 3321144251. The next prime is 3321144347. The reversal of 3321144313 is 3134411233.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2026080144 + 1295064169 = 45012^2 + 35987^2 .
It is a cyclic number.
It is not a de Polignac number, because 3321144313 - 221 = 3319047161 is a prime.
It is a super-2 number, since 2×33211443132 = 22059999095544483938, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3321244313) 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, 1660572156 + 1660572157.
It is an arithmetic number, because the mean of its divisors is an integer number (1660572157).
Almost surely, 23321144313 is an apocalyptic number.
It is an amenable number.
3321144313 is a deficient number, since it is larger than the sum of its proper divisors (1).
3321144313 is an equidigital number, since it uses as much as digits as its factorization.
3321144313 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2592, while the sum is 25.
The square root of 3321144313 is about 57629.3702290768. The cubic root of 3321144313 is about 1491.9785605060.
Adding to 3321144313 its reverse (3134411233), we get a palindrome (6455555546).
The spelling of 3321144313 in words is "three billion, three hundred twenty-one million, one hundred forty-four thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •