Base | Representation |
---|---|
bin | 10110110000101110100100… |
… | …011000010010110111001011 |
3 | 111010102222221122012121201222 |
4 | 112300232210120102313023 |
5 | 101110112142003200021 |
6 | 552523505404432255 |
7 | 30041250053345501 |
oct | 2660564430226713 |
9 | 433388848177658 |
10 | 100105560600011 |
11 | 2999559123737a |
12 | b28916584868b |
13 | 43b1bb5996445 |
14 | 1aa11c6582671 |
15 | b88e96c996ab |
hex | 5b0ba4612dcb |
100105560600011 has 8 divisors (see below), whose sum is σ = 103660110285600. Its totient is φ = 96557853168000.
The previous prime is 100105560599983. The next prime is 100105560600043. The reversal of 100105560600011 is 110006065501001.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-100105560600011 is a prime.
It is a super-2 number, since 2×1001055606000112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (100105560609011) 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 7 ways as a sum of consecutive naturals, for example, 1710533615 + ... + 1710592136.
It is an arithmetic number, because the mean of its divisors is an integer number (12957513785700).
Almost surely, 2100105560600011 is an apocalyptic number.
100105560600011 is a deficient number, since it is larger than the sum of its proper divisors (3554549685589).
100105560600011 is a wasteful number, since it uses less digits than its factorization.
100105560600011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3421126789.
The product of its (nonzero) digits is 900, while the sum is 26.
The spelling of 100105560600011 in words is "one hundred trillion, one hundred five billion, five hundred sixty million, six hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •