Base | Representation |
---|---|
bin | 10000000010011010111… |
… | …100010001101010010100 |
3 | 10220100202000111202222010 |
4 | 100002122330101222110 |
5 | 121024110421320040 |
6 | 2202145230104220 |
7 | 142424224644261 |
oct | 20023274215224 |
9 | 3810660452863 |
10 | 1102111120020 |
11 | 395447aa4789 |
12 | 15971a94b070 |
13 | 7cc0c28a711 |
14 | 3b4b1a0a268 |
15 | 1da05eb2e80 |
hex | 1009af11a94 |
1102111120020 has 96 divisors (see below), whose sum is σ = 3093058281600. Its totient is φ = 293216039424.
The previous prime is 1102111119937. The next prime is 1102111120039. The reversal of 1102111120020 is 200211112011.
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 = 1102111119978 and 1102111120005.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 132508902 + ... + 132517218.
It is an arithmetic number, because the mean of its divisors is an integer number (32219357100).
Almost surely, 21102111120020 is an apocalyptic number.
1102111120020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102111120020 is an abundant number, since it is smaller than the sum of its proper divisors (1990947161580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102111120020 is a wasteful number, since it uses less digits than its factorization.
1102111120020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13177 (or 13175 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 1102111120020 its reverse (200211112011), we get a palindrome (1302322232031).
The spelling of 1102111120020 in words is "one trillion, one hundred two billion, one hundred eleven million, one hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •