Base | Representation |
---|---|
bin | 1010000110000110101111… |
… | …1000110101101110011101 |
3 | 1110022011001110202020201121 |
4 | 2201201223320311232131 |
5 | 2423330302410230401 |
6 | 35335134441410541 |
7 | 2223643325316421 |
oct | 241415370655635 |
9 | 43264043666647 |
10 | 11100005555101 |
11 | 359a538839701 |
12 | 12b3309499a51 |
13 | 62695912a128 |
14 | 2a5359240b81 |
15 | 143b0b13eca1 |
hex | a186be35b9d |
11100005555101 has 6 divisors (see below), whose sum is σ = 11268149996670. Its totient is φ = 10934333825976.
The previous prime is 11100005555083. The next prime is 11100005555141. The reversal of 11100005555101 is 10155550000111.
It can be written as a sum of positive squares in only one way, i.e., 7505572536900 + 3594433018201 = 2739630^2 + 1895899^2 .
It is not a de Polignac number, because 11100005555101 - 219 = 11100005030813 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 (11100005555141) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 1236351666 + ... + 1236360643.
It is an arithmetic number, because the mean of its divisors is an integer number (1878024999445).
Almost surely, 211100005555101 is an apocalyptic number.
It is an amenable number.
11100005555101 is a deficient number, since it is larger than the sum of its proper divisors (168144441569).
11100005555101 is an frugal number, since it uses more digits than its factorization.
11100005555101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2472712443 (or 2472712376 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 25.
Adding to 11100005555101 its reverse (10155550000111), we get a palindrome (21255555555212).
The spelling of 11100005555101 in words is "eleven trillion, one hundred billion, five million, five hundred fifty-five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •