Base | Representation |
---|---|
bin | 10000000001011111110… |
… | …111111010010011010100 |
3 | 10220021011221202202112102 |
4 | 100001133313322103110 |
5 | 121020043222320040 |
6 | 2201503025341232 |
7 | 142360532406404 |
oct | 20013767722324 |
9 | 3807157682472 |
10 | 1101120120020 |
11 | 394a89668818 |
12 | 1594a2a97818 |
13 | 7cab1b81b9b |
14 | 3b41a162804 |
15 | 1d998ead515 |
hex | 1005fdfa4d4 |
1101120120020 has 48 divisors (see below), whose sum is σ = 2388085701120. Its totient is φ = 426233220864.
The previous prime is 1101120120017. The next prime is 1101120120047. The reversal of 1101120120020 is 200210211011.
It is a junction number, because it is equal to n+sod(n) for n = 1101120119983 and 1101120120010.
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, 6497264 + ... + 6664583.
It is an arithmetic number, because the mean of its divisors is an integer number (49751785440).
Almost surely, 21101120120020 is an apocalyptic number.
1101120120020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101120120020 is an abundant number, since it is smaller than the sum of its proper divisors (1286965581100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101120120020 is a wasteful number, since it uses less digits than its factorization.
1101120120020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13161992 (or 13161990 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 1101120120020 its reverse (200210211011), we get a palindrome (1301330331031).
Subtracting from 1101120120020 its reverse (200210211011), we obtain a palindrome (900909909009).
The spelling of 1101120120020 in words is "one trillion, one hundred one billion, one hundred twenty million, one hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •