Base | Representation |
---|---|
bin | 10000000001011111110… |
… | …111110101101010011100 |
3 | 10220021011221201210110201 |
4 | 100001133313311222130 |
5 | 121020043221213040 |
6 | 2201503025113244 |
7 | 142360532300122 |
oct | 20013767655234 |
9 | 3807157653421 |
10 | 1101120101020 |
11 | 394a89655515 |
12 | 1594a2a88824 |
13 | 7cab1b76344 |
14 | 3b41a159912 |
15 | 1d998ea7a9a |
hex | 1005fdf5a9c |
1101120101020 has 12 divisors (see below), whose sum is σ = 2312352212184. Its totient is φ = 440448040400.
The previous prime is 1101120100979. The next prime is 1101120101093. The reversal of 1101120101020 is 201010211011.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a junction number, because it is equal to n+sod(n) for n = 1101120100988 and 1101120101006.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27528002506 + ... + 27528002545.
It is an arithmetic number, because the mean of its divisors is an integer number (192696017682).
Almost surely, 21101120101020 is an apocalyptic number.
1101120101020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101120101020 is an abundant number, since it is smaller than the sum of its proper divisors (1211232111164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101120101020 is a wasteful number, since it uses less digits than its factorization.
1101120101020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55056005060 (or 55056005058 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 1101120101020 its reverse (201010211011), we get a palindrome (1302130312031).
The spelling of 1101120101020 in words is "one trillion, one hundred one billion, one hundred twenty million, one hundred one thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •