Base | Representation |
---|---|
bin | 11000000000000111011100… |
… | …001110011101001110000000 |
3 | 111211202112122222101100120022 |
4 | 120000013130032131032000 |
5 | 102314003121114323013 |
6 | 1012302034100233012 |
7 | 31143352420251464 |
oct | 3000073416351600 |
9 | 454675588340508 |
10 | 105561106011008 |
11 | 306a923940967a |
12 | ba0a54899b768 |
13 | 46b94a5c8bb2b |
14 | 1c0d2830d64a4 |
15 | c30d474e9008 |
hex | 6001dc39d380 |
105561106011008 has 32 divisors (see below), whose sum is σ = 213178303788960. Its totient is φ = 52057531726848.
The previous prime is 105561106010989. The next prime is 105561106011013. The reversal of 105561106011008 is 800110601165501.
It is a tau number, because it is divible by the number of its divisors (32).
It is a super-2 number, since 2×1055611060110082 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5648594360 + ... + 5648613047.
It is an arithmetic number, because the mean of its divisors is an integer number (6661821993405).
Almost surely, 2105561106011008 is an apocalyptic number.
It is an amenable number.
105561106011008 is an abundant number, since it is smaller than the sum of its proper divisors (107617197777952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105561106011008 is an equidigital number, since it uses as much as digits as its factorization.
105561106011008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11297207494 (or 11297207482 counting only the distinct ones).
The product of its (nonzero) digits is 7200, while the sum is 35.
Adding to 105561106011008 its reverse (800110601165501), we get a palindrome (905671707176509).
The spelling of 105561106011008 in words is "one hundred five trillion, five hundred sixty-one billion, one hundred six million, eleven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •