Base | Representation |
---|---|
bin | 1010000110000111001000… |
… | …0111010000111111100101 |
3 | 1110022011022202021121022221 |
4 | 2201201302013100333211 |
5 | 2423331011130000401 |
6 | 35335153052152341 |
7 | 2223646034143663 |
oct | 241416207207745 |
9 | 43264282247287 |
10 | 11100110000101 |
11 | 359a591796791 |
12 | 12b33384686b1 |
13 | 626974968bc5 |
14 | 2a536906bc33 |
15 | 143b153c17a1 |
hex | a18721d0fe5 |
11100110000101 has 4 divisors (see below), whose sum is σ = 11103466553152. Its totient is φ = 11096753447052.
The previous prime is 11100110000093. The next prime is 11100110000129. The reversal of 11100110000101 is 10100001100111.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 11100110000101 - 23 = 11100110000093 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 (11100110000801) 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, 1678271565 + ... + 1678278178.
It is an arithmetic number, because the mean of its divisors is an integer number (2775866638288).
Almost surely, 211100110000101 is an apocalyptic number.
It is an amenable number.
11100110000101 is a deficient number, since it is larger than the sum of its proper divisors (3356553051).
11100110000101 is an equidigital number, since it uses as much as digits as its factorization.
11100110000101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3356553050.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 11100110000101 its reverse (10100001100111), we get a palindrome (21200111100212).
The spelling of 11100110000101 in words is "eleven trillion, one hundred billion, one hundred ten million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •