Base | Representation |
---|---|
bin | 1100000000001011… |
… | …1101101000101101 |
3 | 22022112202200010121 |
4 | 3000002331220231 |
5 | 23044313032341 |
6 | 1251414404541 |
7 | 142562365324 |
oct | 30002755055 |
9 | 8275680117 |
10 | 3222002221 |
11 | 1403810a59 |
12 | 75b060751 |
13 | 3c46a33b9 |
14 | 227cb50bb |
15 | 13cce74d1 |
hex | c00bda2d |
3222002221 has 2 divisors, whose sum is σ = 3222002222. Its totient is φ = 3222002220.
The previous prime is 3222002209. The next prime is 3222002257. The reversal of 3222002221 is 1222002223.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1706846596 + 1515155625 = 41314^2 + 38925^2 .
It is a cyclic number.
It is not a de Polignac number, because 3222002221 - 27 = 3222002093 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 3222002195 and 3222002204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3222092221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1611001110 + 1611001111.
It is an arithmetic number, because the mean of its divisors is an integer number (1611001111).
Almost surely, 23222002221 is an apocalyptic number.
It is an amenable number.
3222002221 is a deficient number, since it is larger than the sum of its proper divisors (1).
3222002221 is an equidigital number, since it uses as much as digits as its factorization.
3222002221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 3222002221 is about 56762.6833491864. The cubic root of 3222002221 is about 1476.9822581020.
Adding to 3222002221 its reverse (1222002223), we get a palindrome (4444004444).
It can be divided in two parts, 3222002 and 221, that added together give a palindrome (3222223).
The spelling of 3222002221 in words is "three billion, two hundred twenty-two million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.822 sec. • engine limits •