Base | Representation |
---|---|
bin | 10000000010011011000… |
… | …000011110001101110100 |
3 | 10220100202002120122212212 |
4 | 100002123000132031310 |
5 | 121024111212020040 |
6 | 2202145305432552 |
7 | 142424240205260 |
oct | 20023300361564 |
9 | 3810662518785 |
10 | 1102112220020 |
11 | 395448686179 |
12 | 15971b19b758 |
13 | 7cc0c5842c6 |
14 | 3b4b1c150a0 |
15 | 1da0612dd65 |
hex | 1009b01e374 |
1102112220020 has 48 divisors (see below), whose sum is σ = 2645143240320. Its totient is φ = 377856488064.
The previous prime is 1102112219993. The next prime is 1102112220049. The reversal of 1102112220020 is 200222112011.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 1102112219977 and 1102112220004.
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, 6210686 + ... + 6385674.
It is an arithmetic number, because the mean of its divisors is an integer number (55107150840).
Almost surely, 21102112220020 is an apocalyptic number.
1102112220020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1102112220020 is an abundant number, since it is smaller than the sum of its proper divisors (1543031020300).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1102112220020 is a wasteful number, since it uses less digits than its factorization.
1102112220020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 219992 (or 219990 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 1102112220020 its reverse (200222112011), we get a palindrome (1302334332031).
The spelling of 1102112220020 in words is "one trillion, one hundred two billion, one hundred twelve million, two hundred twenty thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •