Base | Representation |
---|---|
bin | 11000000000110000011000… |
… | …000111110000100010011100 |
3 | 111211220202010020121211220020 |
4 | 120000300120013300202130 |
5 | 102320213131000423202 |
6 | 1012334143422552140 |
7 | 31146466563621633 |
oct | 3000603007604234 |
9 | 454822106554806 |
10 | 105605060561052 |
11 | 30715944628698 |
12 | ba16b75138650 |
13 | 46c068c40b720 |
14 | 1c1145298651a |
15 | c3206b2795bc |
hex | 600c181f089c |
105605060561052 has 48 divisors (see below), whose sum is σ = 265367641620480. Its totient is φ = 32493732643008.
The previous prime is 105605060561027. The next prime is 105605060561101. The reversal of 105605060561052 is 250165060506501.
It is a super-2 number, since 2×1056050605610522 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105605060560995 and 105605060561013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 41341573 + ... + 43821635.
It is an arithmetic number, because the mean of its divisors is an integer number (5528492533760).
Almost surely, 2105605060561052 is an apocalyptic number.
105605060561052 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
105605060561052 is an abundant number, since it is smaller than the sum of its proper divisors (159762581059428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105605060561052 is a wasteful number, since it uses less digits than its factorization.
105605060561052 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2753042 (or 2753040 counting only the distinct ones).
The product of its (nonzero) digits is 270000, while the sum is 42.
The spelling of 105605060561052 in words is "one hundred five trillion, six hundred five billion, sixty million, five hundred sixty-one thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •