Base | Representation |
---|---|
bin | 10110110000101110100110… |
… | …101110100111010110111000 |
3 | 111010110000001101100121222202 |
4 | 112300232212232213112320 |
5 | 101110112232100134220 |
6 | 552523513333205332 |
7 | 30041251042316462 |
oct | 2660564656472670 |
9 | 433400041317882 |
10 | 100105600005560 |
11 | 29995601501346 |
12 | b289176a90848 |
13 | 43b1bc0bb2536 |
14 | 1aa11cb8bd132 |
15 | b88e9a480275 |
hex | 5b0ba6ba75b8 |
100105600005560 has 32 divisors (see below), whose sum is σ = 229055186458800. Its totient is φ = 39363557967360.
The previous prime is 100105600005557. The next prime is 100105600005569. The reversal of 100105600005560 is 65500006501001.
It is a super-2 number, since 2×1001056000055602 (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 (100105600005569) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 21208811201 + ... + 21208815920.
Almost surely, 2100105600005560 is an apocalyptic number.
100105600005560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100105600005560 is an abundant number, since it is smaller than the sum of its proper divisors (128949586453240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100105600005560 is a wasteful number, since it uses less digits than its factorization.
100105600005560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 42417627191 (or 42417627187 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 29.
Adding to 100105600005560 its reverse (65500006501001), we get a palindrome (165605606506561).
The spelling of 100105600005560 in words is "one hundred trillion, one hundred five billion, six hundred million, five thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •