Base | Representation |
---|---|
bin | 11010010001100… |
… | …01100100101101 |
3 | 120100201200110121 |
4 | 31020301210231 |
5 | 422410412023 |
6 | 33512004541 |
7 | 5314255204 |
oct | 1510614455 |
9 | 510650417 |
10 | 220404013 |
11 | 103459885 |
12 | 61990751 |
13 | 3687c59b |
14 | 213b423b |
15 | 14539d5d |
hex | d23192d |
220404013 has 2 divisors, whose sum is σ = 220404014. Its totient is φ = 220404012.
The previous prime is 220404011. The next prime is 220404053. The reversal of 220404013 is 310404022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 198753604 + 21650409 = 14098^2 + 4653^2 .
It is a cyclic number.
It is not a de Polignac number, because 220404013 - 21 = 220404011 is a prime.
Together with 220404011, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220404011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110202006 + 110202007.
It is an arithmetic number, because the mean of its divisors is an integer number (110202007).
Almost surely, 2220404013 is an apocalyptic number.
It is an amenable number.
220404013 is a deficient number, since it is larger than the sum of its proper divisors (1).
220404013 is an equidigital number, since it uses as much as digits as its factorization.
220404013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 16.
The square root of 220404013 is about 14846.0100026910. The cubic root of 220404013 is about 604.0503855823.
Adding to 220404013 its reverse (310404022), we get a palindrome (530808035).
Subtracting 220404013 from its reverse (310404022), we obtain a palindrome (90000009).
The spelling of 220404013 in words is "two hundred twenty million, four hundred four thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •