Base | Representation |
---|---|
bin | 110010000100010110010110… |
… | …111110101011011111111000 |
3 | 1001212200000211000200021120102 |
4 | 302010112112332223133320 |
5 | 212330234040043441440 |
6 | 2100155012344214532 |
7 | 64245004202304563 |
oct | 6204262676533770 |
9 | 1055600730607512 |
10 | 220201211312120 |
11 | 6418789a174285 |
12 | 2084457816a448 |
13 | 95b3b678170cc |
14 | 3c53b1cb994da |
15 | 1a6ce138bbb15 |
hex | c84596fab7f8 |
220201211312120 has 64 divisors (see below), whose sum is σ = 521728474528800. Its totient is φ = 83412783175680.
The previous prime is 220201211312107. The next prime is 220201211312149. The reversal of 220201211312120 is 21213112102022.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 220201211312092 and 220201211312101.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 53368061 + ... + 57345900.
Almost surely, 2220201211312120 is an apocalyptic number.
220201211312120 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
220201211312120 is an abundant number, since it is smaller than the sum of its proper divisors (301527263216680).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
220201211312120 is a wasteful number, since it uses less digits than its factorization.
220201211312120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 110716608 (or 110716604 counting only the distinct ones).
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 220201211312120 its reverse (21213112102022), we get a palindrome (241414323414142).
The spelling of 220201211312120 in words is "two hundred twenty trillion, two hundred one billion, two hundred eleven million, three hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •