Base | Representation |
---|---|
bin | 10110110000101110100100… |
… | …010110000001100111101101 |
3 | 111010102222221121002101200021 |
4 | 112300232210112001213231 |
5 | 101110112141330130401 |
6 | 552523505344002141 |
7 | 30041250045320200 |
oct | 2660564426014755 |
9 | 433388847071607 |
10 | 100105560005101 |
11 | 29995590970412 |
12 | b289165600351 |
13 | 43b1bb5818721 |
14 | 1aa11c6469937 |
15 | b88e96bcd2a1 |
hex | 5b0ba45819ed |
100105560005101 has 12 divisors (see below), whose sum is σ = 122578236742080. Its totient is φ = 81288725416920.
The previous prime is 100105560005093. The next prime is 100105560005107. The reversal of 100105560005101 is 101500065501001.
It is not a de Polignac number, because 100105560005101 - 23 = 100105560005093 is a prime.
It is a super-2 number, since 2×1001055600051012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100105560005107) 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 11 ways as a sum of consecutive naturals, for example, 53762383605 + ... + 53762385466.
It is an arithmetic number, because the mean of its divisors is an integer number (10214853061840).
Almost surely, 2100105560005101 is an apocalyptic number.
It is an amenable number.
100105560005101 is a deficient number, since it is larger than the sum of its proper divisors (22472676736979).
100105560005101 is a wasteful number, since it uses less digits than its factorization.
100105560005101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 107524769104 (or 107524769097 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 25.
The spelling of 100105560005101 in words is "one hundred trillion, one hundred five billion, five hundred sixty million, five thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •