Base | Representation |
---|---|
bin | 110000111100101011… |
… | …0001101111101000000 |
3 | 101001022122120110101221 |
4 | 1201321112031331000 |
5 | 3210233430120220 |
6 | 120142245004424 |
7 | 10410564313435 |
oct | 1417126157500 |
9 | 331278513357 |
10 | 105115082560 |
11 | 406407a6364 |
12 | 184569b3714 |
13 | 9bb2462c07 |
14 | 513251bb8c |
15 | 2b033249aa |
hex | 187958df40 |
105115082560 has 56 divisors (see below), whose sum is σ = 251257222656. Its totient is φ = 41886128640.
The previous prime is 105115082557. The next prime is 105115082561. The reversal of 105115082560 is 65280511501.
It is a super-2 number, since 2×1051150825602 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (105115082561) 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, 540336 + ... + 708655.
Almost surely, 2105115082560 is an apocalyptic number.
105115082560 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
105115082560 is an abundant number, since it is smaller than the sum of its proper divisors (146142140096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105115082560 is a wasteful number, since it uses less digits than its factorization.
105115082560 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1249271 (or 1249261 counting only the distinct ones).
The product of its (nonzero) digits is 12000, while the sum is 34.
The spelling of 105115082560 in words is "one hundred five billion, one hundred fifteen million, eighty-two thousand, five hundred sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •