Base | Representation |
---|---|
bin | 11001000010001011101111… |
… | …000010101000101000101100 |
3 | 112102211120110002011200200011 |
4 | 121002023233002220220230 |
5 | 103412344230220023040 |
6 | 1030055443300143004 |
7 | 32122356266335111 |
oct | 3102135702505054 |
9 | 472746402150604 |
10 | 110101202111020 |
11 | 3209972629407a |
12 | 10422425997a64 |
13 | 4958663b641a3 |
14 | 1d28cd88c0908 |
15 | cadeb92533ea |
hex | 6422ef0a8a2c |
110101202111020 has 12 divisors (see below), whose sum is σ = 231212524433184. Its totient is φ = 44040480844400.
The previous prime is 110101202111011. The next prime is 110101202111027. The reversal of 110101202111020 is 20111202101011.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (110101202111027) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2752530052756 + ... + 2752530052795.
It is an arithmetic number, because the mean of its divisors is an integer number (19267710369432).
Almost surely, 2110101202111020 is an apocalyptic number.
110101202111020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
110101202111020 is an abundant number, since it is smaller than the sum of its proper divisors (121111322322164).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110101202111020 is a wasteful number, since it uses less digits than its factorization.
110101202111020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5505060105560 (or 5505060105558 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 110101202111020 its reverse (20111202101011), we get a palindrome (130212404212031).
The spelling of 110101202111020 in words is "one hundred ten trillion, one hundred one billion, two hundred two million, one hundred eleven thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •