Base | Representation |
---|---|
bin | 1010000110101100011011… |
… | …1000011110001110100101 |
3 | 1110100010011111211222222012 |
4 | 2201223012320132032211 |
5 | 2424012012230320401 |
6 | 35343530350444005 |
7 | 2224452116565134 |
oct | 241530670361645 |
9 | 43303144758865 |
10 | 11110122120101 |
11 | 35a385a329724 |
12 | 12b5271503605 |
13 | 6278ac00ab74 |
14 | 2a5a38a6791b |
15 | 143eee3758bb |
hex | a1ac6e1e3a5 |
11110122120101 has 16 divisors (see below), whose sum is σ = 11705125199040. Its totient is φ = 10516146825600.
The previous prime is 11110122120089. The next prime is 11110122120109. The reversal of 11110122120101 is 10102122101111.
11110122120101 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is not a de Polignac number, because 11110122120101 - 234 = 11092942250917 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11110122120109) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 304594001 + ... + 304630473.
It is an arithmetic number, because the mean of its divisors is an integer number (731570324940).
Almost surely, 211110122120101 is an apocalyptic number.
It is an amenable number.
11110122120101 is a deficient number, since it is larger than the sum of its proper divisors (595003078939).
11110122120101 is a wasteful number, since it uses less digits than its factorization.
11110122120101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50116.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 11110122120101 its reverse (10102122101111), we get a palindrome (21212244221212).
The spelling of 11110122120101 in words is "eleven trillion, one hundred ten billion, one hundred twenty-two million, one hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •