Base | Representation |
---|---|
bin | 1011111111110000… |
… | …1010110010111001 |
3 | 22022102102011220122 |
4 | 2333330022302321 |
5 | 23043334033423 |
6 | 1251312303025 |
7 | 142541266514 |
oct | 27774126271 |
9 | 8272364818 |
10 | 3220221113 |
11 | 140280486a |
12 | 75a541a75 |
13 | 3c41cb7a5 |
14 | 22796dd7b |
15 | 13ca948c8 |
hex | bff0acb9 |
3220221113 has 2 divisors, whose sum is σ = 3220221114. Its totient is φ = 3220221112.
The previous prime is 3220221091. The next prime is 3220221127. The reversal of 3220221113 is 3111220223.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1639602064 + 1580619049 = 40492^2 + 39757^2 .
It is a cyclic number.
It is not a de Polignac number, because 3220221113 - 212 = 3220217017 is a prime.
It is a super-2 number, since 2×32202211132 = 20739648033221917538, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 3220221091 and 3220221100.
It is not a weakly prime, because it can be changed into another prime (3220221163) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1610110556 + 1610110557.
It is an arithmetic number, because the mean of its divisors is an integer number (1610110557).
Almost surely, 23220221113 is an apocalyptic number.
It is an amenable number.
3220221113 is a deficient number, since it is larger than the sum of its proper divisors (1).
3220221113 is an equidigital number, since it uses as much as digits as its factorization.
3220221113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 144, while the sum is 17.
The square root of 3220221113 is about 56746.9921053090. The cubic root of 3220221113 is about 1476.7100516060.
Adding to 3220221113 its reverse (3111220223), we get a palindrome (6331441336).
The spelling of 3220221113 in words is "three billion, two hundred twenty million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •