Base | Representation |
---|---|
bin | 101110111000001011100… |
… | …110100100011110001001 |
3 | 102101222001022022102101101 |
4 | 232320023212210132021 |
5 | 410234432023212413 |
6 | 10503522221221401 |
7 | 451511536220152 |
oct | 56701346443611 |
9 | 12358038272341 |
10 | 3221420132233 |
11 | 10322187562a6 |
12 | 4403bb101861 |
13 | 1a4a17803b24 |
14 | b1cbbb32929 |
15 | 58be3453edd |
hex | 2ee0b9a4789 |
3221420132233 has 2 divisors, whose sum is σ = 3221420132234. Its totient is φ = 3221420132232.
The previous prime is 3221420132201. The next prime is 3221420132257. The reversal of 3221420132233 is 3322310241223.
3221420132233 is digitally balanced in base 2 and base 3, because in such bases it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3166360448329 + 55059683904 = 1779427^2 + 234648^2 .
It is a cyclic number.
It is not a de Polignac number, because 3221420132233 - 25 = 3221420132201 is a prime.
It is not a weakly prime, because it can be changed into another prime (3221420132633) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1610710066116 + 1610710066117.
It is an arithmetic number, because the mean of its divisors is an integer number (1610710066117).
Almost surely, 23221420132233 is an apocalyptic number.
It is an amenable number.
3221420132233 is a deficient number, since it is larger than the sum of its proper divisors (1).
3221420132233 is an equidigital number, since it uses as much as digits as its factorization.
3221420132233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10368, while the sum is 28.
Adding to 3221420132233 its reverse (3322310241223), we get a palindrome (6543730373456).
The spelling of 3221420132233 in words is "three trillion, two hundred twenty-one billion, four hundred twenty million, one hundred thirty-two thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •