Base | Representation |
---|---|
bin | 1010000000010110010100… |
… | …0100011011100000010110 |
3 | 1102221200210001111021122222 |
4 | 2200011211010123200112 |
5 | 2420220231331430420 |
6 | 35221501100222342 |
7 | 2213542453546040 |
oct | 240054504334026 |
9 | 42850701437588 |
10 | 11001106905110 |
11 | 35615a8060123 |
12 | 129810853a9b2 |
13 | 61a5278519aa |
14 | 2a0656590a90 |
15 | 14126d956225 |
hex | a016511b816 |
11001106905110 has 32 divisors (see below), whose sum is σ = 22631106551040. Its totient is φ = 3771765071712.
The previous prime is 11001106905109. The next prime is 11001106905163. The reversal of 11001106905110 is 1150960110011.
It is a super-2 number, since 2×110011069051102 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 11001106905110.
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, 5622881 + ... + 7322499.
It is an arithmetic number, because the mean of its divisors is an integer number (707222079720).
Almost surely, 211001106905110 is an apocalyptic number.
11001106905110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11001106905110 is an abundant number, since it is smaller than the sum of its proper divisors (11629999645930).
11001106905110 is a wasteful number, since it uses less digits than its factorization.
11001106905110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1792100.
The product of its (nonzero) digits is 270, while the sum is 26.
The spelling of 11001106905110 in words is "eleven trillion, one billion, one hundred six million, nine hundred five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •