Base | Representation |
---|---|
bin | 110010000100101000001010… |
… | …001100001100110010111101 |
3 | 1001212201212011000202210000012 |
4 | 302010220022030030302331 |
5 | 212331042210432333110 |
6 | 2100211453101513005 |
7 | 64246251632335151 |
oct | 6204501214146275 |
9 | 1055655130683005 |
10 | 220220324105405 |
11 | 64194a07909808 |
12 | 20848210b72765 |
13 | 95b58c2457450 |
14 | 3c54a132d5061 |
15 | 1a6d6817d6905 |
hex | c84a0a30ccbd |
220220324105405 has 64 divisors (see below), whose sum is σ = 314022274191360. Its totient is φ = 146864156313600.
The previous prime is 220220324105401. The next prime is 220220324105423. The reversal of 220220324105405 is 504501423022022.
It is not a de Polignac number, because 220220324105405 - 22 = 220220324105401 is a prime.
It is a super-2 number, since 2×2202203241054052 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (220220324105401) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 56048150 + ... + 59848439.
It is an arithmetic number, because the mean of its divisors is an integer number (4906598034240).
Almost surely, 2220220324105405 is an apocalyptic number.
It is an amenable number.
220220324105405 is a deficient number, since it is larger than the sum of its proper divisors (93801950085955).
220220324105405 is a wasteful number, since it uses less digits than its factorization.
220220324105405 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115896702.
The product of its (nonzero) digits is 38400, while the sum is 32.
Adding to 220220324105405 its reverse (504501423022022), we get a palindrome (724721747127427).
The spelling of 220220324105405 in words is "two hundred twenty trillion, two hundred twenty billion, three hundred twenty-four million, one hundred five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •