Base | Representation |
---|---|
bin | 110010010100011111001101… |
… | …000100010011111101100101 |
3 | 1002000121001100202210002122101 |
4 | 302110133031010103331211 |
5 | 213001421312400224423 |
6 | 2102404302304132101 |
7 | 64421064366323164 |
oct | 6224371504237545 |
9 | 1060531322702571 |
10 | 221310220320613 |
11 | 64575156909736 |
12 | 209a34a1007031 |
13 | 9664605ba7b28 |
14 | 3c916869413db |
15 | 1a8bbc02287ad |
hex | c947cd113f65 |
221310220320613 has 2 divisors, whose sum is σ = 221310220320614. Its totient is φ = 221310220320612.
The previous prime is 221310220320587. The next prime is 221310220320619. The reversal of 221310220320613 is 316023022013122.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 114405228897444 + 106904991423169 = 10696038^2 + 10339487^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-221310220320613 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221310220320619) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110655110160306 + 110655110160307.
It is an arithmetic number, because the mean of its divisors is an integer number (110655110160307).
Almost surely, 2221310220320613 is an apocalyptic number.
It is an amenable number.
221310220320613 is a deficient number, since it is larger than the sum of its proper divisors (1).
221310220320613 is an equidigital number, since it uses as much as digits as its factorization.
221310220320613 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 28.
Adding to 221310220320613 its reverse (316023022013122), we get a palindrome (537333242333735).
The spelling of 221310220320613 in words is "two hundred twenty-one trillion, three hundred ten billion, two hundred twenty million, three hundred twenty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •