Base | Representation |
---|---|
bin | 110000111011000101… |
… | …0001001011001110000 |
3 | 101001011220220120200000 |
4 | 1201312022021121300 |
5 | 3210131231232134 |
6 | 120133054230000 |
7 | 10406344515405 |
oct | 1416612113160 |
9 | 331156816600 |
10 | 105061586544 |
11 | 40613587a82 |
12 | 18440ab5300 |
13 | 9ba4352475 |
14 | 51293942ac |
15 | 2aed7a8e99 |
hex | 1876289670 |
105061586544 has 120 divisors (see below), whose sum is σ = 305153979312. Its totient is φ = 34993244160.
The previous prime is 105061586533. The next prime is 105061586653. The reversal of 105061586544 is 445685160501.
105061586544 is a `hidden beast` number, since 1 + 0 + 5 + 0 + 61 + 586 + 5 + 4 + 4 = 666.
It is a super-2 number, since 2×1050615865442 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 105061586544.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 5328384 + ... + 5348064.
Almost surely, 2105061586544 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 105061586544, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (152576989656).
105061586544 is an abundant number, since it is smaller than the sum of its proper divisors (200092392768).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
105061586544 is a wasteful number, since it uses less digits than its factorization.
105061586544 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 21077 (or 21059 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 45.
The spelling of 105061586544 in words is "one hundred five billion, sixty-one million, five hundred eighty-six thousand, five hundred forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •