Base | Representation |
---|---|
bin | 10111001101110001000100… |
… | …011101010111101001001100 |
3 | 111101111202210222112222011212 |
4 | 113031301010131113221030 |
5 | 101340311033421011340 |
6 | 1001052334121433552 |
7 | 30335363466664235 |
oct | 2715610435275114 |
9 | 441452728488155 |
10 | 102101111110220 |
11 | 2a5949244a6672 |
12 | b54ba6763b8b8 |
13 | 44c812a45a701 |
14 | 1b2da1211408c |
15 | bc0d3e314a65 |
hex | 5cdc44757a4c |
102101111110220 has 48 divisors (see below), whose sum is σ = 215108170300800. Its totient is φ = 40707917193216.
The previous prime is 102101111110157. The next prime is 102101111110277. The reversal of 102101111110220 is 22011111101201.
It is a junction number, because it is equal to n+sod(n) for n = 102101111110195 and 102101111110204.
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, 127297964 + ... + 128097516.
It is an arithmetic number, because the mean of its divisors is an integer number (4481420214600).
Almost surely, 2102101111110220 is an apocalyptic number.
102101111110220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102101111110220 is an abundant number, since it is smaller than the sum of its proper divisors (113007059190580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102101111110220 is a wasteful number, since it uses less digits than its factorization.
102101111110220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 820274 (or 820272 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102101111110220 its reverse (22011111101201), we get a palindrome (124112222211421).
The spelling of 102101111110220 in words is "one hundred two trillion, one hundred one billion, one hundred eleven million, one hundred ten thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •