Base | Representation |
---|---|
bin | 110001101000100110… |
… | …0001011101110100000 |
3 | 101012010100201110011101 |
4 | 1203101030023232200 |
5 | 3221243221101013 |
6 | 120544412524144 |
7 | 10462241152000 |
oct | 1432114135640 |
9 | 335110643141 |
10 | 106588847008 |
11 | 41227697406 |
12 | 187a8480654 |
13 | a08889a797 |
14 | 5232152000 |
15 | 2b8c8da8dd |
hex | 18d130bba0 |
106588847008 has 192 divisors, whose sum is σ = 258486681600. Its totient is φ = 43159877376.
The previous prime is 106588846937. The next prime is 106588847017. The reversal of 106588847008 is 800748885601.
It is a happy number.
It is a super-2 number, since 2×1065888470082 (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 106588847008.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 20950641 + ... + 20955727.
It is an arithmetic number, because the mean of its divisors is an integer number (1346284800).
Almost surely, 2106588847008 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 106588847008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129243340800).
106588847008 is an abundant number, since it is smaller than the sum of its proper divisors (151897834592).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106588847008 is an equidigital number, since it uses as much as digits as its factorization.
106588847008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5224 (or 5202 counting only the distinct ones).
The product of its (nonzero) digits is 3440640, while the sum is 55.
The spelling of 106588847008 in words is "one hundred six billion, five hundred eighty-eight million, eight hundred forty-seven thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •