Base | Representation |
---|---|
bin | 10110110000101110100110… |
… | …101110100111011000110111 |
3 | 111010110000001101100122011110 |
4 | 112300232212232213120313 |
5 | 101110112232100140222 |
6 | 552523513333210103 |
7 | 30041251042320033 |
oct | 2660564656473067 |
9 | 433400041318143 |
10 | 100105600005687 |
11 | 29995601501451 |
12 | b289176a90933 |
13 | 43b1bc0bb2603 |
14 | 1aa11cb8bd1c3 |
15 | b88e9a48030c |
hex | 5b0ba6ba7637 |
100105600005687 has 16 divisors (see below), whose sum is σ = 142423732770560. Its totient is φ = 62358499207872.
The previous prime is 100105600005683. The next prime is 100105600005709. The reversal of 100105600005687 is 786500006501001.
It is not a de Polignac number, because 100105600005687 - 22 = 100105600005683 is a prime.
It is a super-3 number, since 3×1001056000056873 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (100105600005683) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 12029027323 + ... + 12029035644.
It is an arithmetic number, because the mean of its divisors is an integer number (8901483298160).
Almost surely, 2100105600005687 is an apocalyptic number.
100105600005687 is a deficient number, since it is larger than the sum of its proper divisors (42318132764873).
100105600005687 is a wasteful number, since it uses less digits than its factorization.
100105600005687 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24058063062.
The product of its (nonzero) digits is 50400, while the sum is 39.
Adding to 100105600005687 its reverse (786500006501001), we get a palindrome (886605606506688).
The spelling of 100105600005687 in words is "one hundred trillion, one hundred five billion, six hundred million, five thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •