Base | Representation |
---|---|
bin | 1011111111110000… |
… | …0110011101000011 |
3 | 22022102101021112001 |
4 | 2333330012131003 |
5 | 23043333001311 |
6 | 1251312044431 |
7 | 142541163622 |
oct | 27774063503 |
9 | 8272337461 |
10 | 3220203331 |
11 | 14027a2474 |
12 | 75a533717 |
13 | 3c41c3677 |
14 | 2279676b9 |
15 | 13ca8e4c1 |
hex | bff06743 |
3220203331 has 2 divisors, whose sum is σ = 3220203332. Its totient is φ = 3220203330.
The previous prime is 3220203289. The next prime is 3220203383. The reversal of 3220203331 is 1333020223.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 3220203331 - 227 = 3085985603 is a prime.
It is a super-2 number, since 2×32202033312 = 20739418985966991122, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3220203299 and 3220203308.
It is not a weakly prime, because it can be changed into another prime (3220203031) 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, 1610101665 + 1610101666.
It is an arithmetic number, because the mean of its divisors is an integer number (1610101666).
Almost surely, 23220203331 is an apocalyptic number.
3220203331 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220203331 is an equidigital number, since it uses as much as digits as its factorization.
3220203331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 648, while the sum is 19.
The square root of 3220203331 is about 56746.8354271848. The cubic root of 3220203331 is about 1476.7073334793.
Adding to 3220203331 its reverse (1333020223), we get a palindrome (4553223554).
The spelling of 3220203331 in words is "three billion, two hundred twenty million, two hundred three thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.844 sec. • engine limits •