Base | Representation |
---|---|
bin | 10110110000110010101100… |
… | …111111010001000001001101 |
3 | 111010110102102000201120011120 |
4 | 112300302230333101001031 |
5 | 101110200240000013401 |
6 | 552525522112311153 |
7 | 30041465060546016 |
oct | 2660625477210115 |
9 | 433412360646146 |
10 | 100110000001101 |
11 | 2999745a1580a2 |
12 | b289ba45424b9 |
13 | 43b24426434ac |
14 | 1aa14c7dd600d |
15 | b891568b7836 |
hex | 5b0cacfd104d |
100110000001101 has 16 divisors (see below), whose sum is σ = 140519220979200. Its totient is φ = 63221087402928.
The previous prime is 100110000001051. The next prime is 100110000001181. The reversal of 100110000001101 is 101100000011001.
It is not a de Polignac number, because 100110000001101 - 227 = 100109865783373 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 100110000001101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100110000001181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 86657521 + ... + 87805158.
It is an arithmetic number, because the mean of its divisors is an integer number (8782451311200).
Almost surely, 2100110000001101 is an apocalyptic number.
It is an amenable number.
100110000001101 is a deficient number, since it is larger than the sum of its proper divisors (40409220978099).
100110000001101 is a wasteful number, since it uses less digits than its factorization.
100110000001101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 174472768.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 100110000001101 its reverse (101100000011001), we get a palindrome (201210000012102).
The spelling of 100110000001101 in words is "one hundred trillion, one hundred ten billion, one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •