Base | Representation |
---|---|
bin | 1010000110000110101110… |
… | …0100000001111100000101 |
3 | 1110022011001002111002212120 |
4 | 2201201223210001330011 |
5 | 2423330300011200401 |
6 | 35335134124440153 |
7 | 2223643231046553 |
oct | 241415344017405 |
9 | 43264032432776 |
10 | 11100000100101 |
11 | 359a535753240 |
12 | 12b33076a9059 |
13 | 626957c6a213 |
14 | 2a5358620bd3 |
15 | 143b0a913836 |
hex | a186b901f05 |
11100000100101 has 16 divisors (see below), whose sum is σ = 16145517854208. Its totient is φ = 6727246470000.
The previous prime is 11100000100051. The next prime is 11100000100121. The reversal of 11100000100101 is 10100100000111.
It is not a de Polignac number, because 11100000100101 - 210 = 11100000099077 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11100000100101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11100000100121) 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, 10974960 + ... + 11943606.
It is an arithmetic number, because the mean of its divisors is an integer number (1009094865888).
Almost surely, 211100000100101 is an apocalyptic number.
11100000100101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
11100000100101 is a deficient number, since it is larger than the sum of its proper divisors (5045517754107).
11100000100101 is a wasteful number, since it uses less digits than its factorization.
11100000100101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1315912.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 11100000100101 its reverse (10100100000111), we get a palindrome (21200100100212).
The spelling of 11100000100101 in words is "eleven trillion, one hundred billion, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •