Base | Representation |
---|---|
bin | 1010000110000111001101… |
… | …0101111000101110111111 |
3 | 1110022011101012001200221122 |
4 | 2201201303111320232333 |
5 | 2423331031414010421 |
6 | 35335155110021155 |
7 | 2223646404263324 |
oct | 241416325705677 |
9 | 43264335050848 |
10 | 11100130610111 |
11 | 359a5a2393354 |
12 | 12b33433477bb |
13 | 626979003b8a |
14 | 2a536bab4b4b |
15 | 143b170e32ab |
hex | a1873578bbf |
11100130610111 has 8 divisors (see below), whose sum is σ = 11482149498960. Its totient is φ = 10722428319168.
The previous prime is 11100130610069. The next prime is 11100130610113. The reversal of 11100130610111 is 11101603100111.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11100130610111 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 11100130610111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100130610113) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1079144246 + ... + 1079154531.
It is an arithmetic number, because the mean of its divisors is an integer number (1435268687370).
Almost surely, 211100130610111 is an apocalyptic number.
11100130610111 is a deficient number, since it is larger than the sum of its proper divisors (382018888849).
11100130610111 is a wasteful number, since it uses less digits than its factorization.
11100130610111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2158298953.
The product of its (nonzero) digits is 18, while the sum is 17.
Adding to 11100130610111 its reverse (11101603100111), we get a palindrome (22201733710222).
The spelling of 11100130610111 in words is "eleven trillion, one hundred billion, one hundred thirty million, six hundred ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •