Base | Representation |
---|---|
bin | 10001110000010100001… |
… | …110101111010001010100 |
3 | 11022122022120110001111110 |
4 | 101300110032233101110 |
5 | 124442241142320040 |
6 | 2332302202135020 |
7 | 154102315621401 |
oct | 21602416572124 |
9 | 4278276401443 |
10 | 1220110120020 |
11 | 43049a3999a0 |
12 | 1785704b1470 |
13 | 8b095a3a4cc |
14 | 430a72b72a8 |
15 | 21b10459980 |
hex | 11c143af454 |
1220110120020 has 48 divisors (see below), whose sum is σ = 3726881823168. Its totient is φ = 295784271360.
The previous prime is 1220110120003. The next prime is 1220110120051. The reversal of 1220110120020 is 200210110221.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 1220110119978 and 1220110120005.
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, 924325189 + ... + 924326508.
It is an arithmetic number, because the mean of its divisors is an integer number (77643371316).
Almost surely, 21220110120020 is an apocalyptic number.
1220110120020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1220110120020 is an abundant number, since it is smaller than the sum of its proper divisors (2506771703148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1220110120020 is a wasteful number, since it uses less digits than its factorization.
1220110120020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1848651720 (or 1848651718 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 1220110120020 its reverse (200210110221), we get a palindrome (1420320230241).
The spelling of 1220110120020 in words is "one trillion, two hundred twenty billion, one hundred ten million, one hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •