Base | Representation |
---|---|
bin | 10000000001100100101… |
… | …100110100110011110100 |
3 | 10220021101121010222012200 |
4 | 100001210230310303310 |
5 | 121020224440200040 |
6 | 2201515041144500 |
7 | 142362534623610 |
oct | 20014454646364 |
9 | 3807347128180 |
10 | 1101201100020 |
11 | 39502034923a |
12 | 15950602b130 |
13 | 7cac5896348 |
14 | 3b426c02340 |
15 | 1d9a1157630 |
hex | 10064b34cf4 |
1101201100020 has 144 divisors (see below), whose sum is σ = 3856853215488. Its totient is φ = 249108203520.
The previous prime is 1101201100019. The next prime is 1101201100063. The reversal of 1101201100020 is 200011021011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 1101201099975 and 1101201100011.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 4382776 + ... + 4627215.
Almost surely, 21101201100020 is an apocalyptic number.
1101201100020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101201100020 is an abundant number, since it is smaller than the sum of its proper divisors (2755652115468).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101201100020 is a wasteful number, since it uses less digits than its factorization.
1101201100020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9010110 (or 9010105 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 1101201100020 its reverse (200011021011), we get a palindrome (1301212121031).
The spelling of 1101201100020 in words is "one trillion, one hundred one billion, two hundred one million, one hundred thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •