Base | Representation |
---|---|
bin | 11001000010010100000111… |
… | …011011000011111110001100 |
3 | 112102212102200020100210212112 |
4 | 121002110013123003332030 |
5 | 103413021142440232340 |
6 | 1030103532243523152 |
7 | 32123125300445054 |
oct | 3102240733037614 |
9 | 472772606323775 |
10 | 110110201102220 |
11 | 320a2523a56390 |
12 | 104241176894b8 |
13 | 4959469350257 |
14 | 1d2950db12564 |
15 | cae3442d1065 |
hex | 6425076c3f8c |
110110201102220 has 24 divisors (see below), whose sum is σ = 252252460707408. Its totient is φ = 40040073128000.
The previous prime is 110110201102211. The next prime is 110110201102243. The reversal of 110110201102220 is 22201102011011.
It is a junction number, because it is equal to n+sod(n) for n = 110110201102195 and 110110201102204.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 250250456831 + ... + 250250457270.
It is an arithmetic number, because the mean of its divisors is an integer number (10510519196142).
Almost surely, 2110110201102220 is an apocalyptic number.
110110201102220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110110201102220 is an abundant number, since it is smaller than the sum of its proper divisors (142142259605188).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110110201102220 is a wasteful number, since it uses less digits than its factorization.
110110201102220 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 500500914121 (or 500500914119 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 14.
Adding to 110110201102220 its reverse (22201102011011), we get a palindrome (132311303113231).
The spelling of 110110201102220 in words is "one hundred ten trillion, one hundred ten billion, two hundred one million, one hundred two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •