Base | Representation |
---|---|
bin | 10000000001100101111… |
… | …001100010111101110100 |
3 | 10220021102222222202200120 |
4 | 100001211321202331310 |
5 | 121020300112241040 |
6 | 2201521040211540 |
7 | 142363200600306 |
oct | 20014571427564 |
9 | 3807388882616 |
10 | 1101221212020 |
11 | 395030735726 |
12 | 159510909bb0 |
13 | 7cac9ab8737 |
14 | 3b429759976 |
15 | 1d9a2ccb7d0 |
hex | 10065e62f74 |
1101221212020 has 48 divisors (see below), whose sum is σ = 3166755059328. Its totient is φ = 285722259840.
The previous prime is 1101221212019. The next prime is 1101221212033. The reversal of 1101221212020 is 202121221011.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 248020576 + ... + 248025015.
It is an arithmetic number, because the mean of its divisors is an integer number (65974063736).
Almost surely, 21101221212020 is an apocalyptic number.
1101221212020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1101221212020 is an abundant number, since it is smaller than the sum of its proper divisors (2065533847308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1101221212020 is a wasteful number, since it uses less digits than its factorization.
1101221212020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 496045640 (or 496045638 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 1101221212020 its reverse (202121221011), we get a palindrome (1303342433031).
The spelling of 1101221212020 in words is "one trillion, one hundred one billion, two hundred twenty-one million, two hundred twelve thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.138 sec. • engine limits •