Base | Representation |
---|---|
bin | 11000101100001000100110… |
… | …001110111000101000101000 |
3 | 112020110201110100202200211110 |
4 | 120230020212032320220220 |
5 | 103213033114140114142 |
6 | 1022535415531230320 |
7 | 31605036264165105 |
oct | 3054104616705050 |
9 | 466421410680743 |
10 | 108586004613672 |
11 | 3166507a856023 |
12 | 102188412a83a0 |
13 | 4878802012701 |
14 | 1cb583aaddaac |
15 | c84887a8199c |
hex | 62c2263b8a28 |
108586004613672 has 32 divisors (see below), whose sum is σ = 272069610696000. Its totient is φ = 36114721649664.
The previous prime is 108586004613661. The next prime is 108586004613677. The reversal of 108586004613672 is 276316400685801.
It is not an unprimeable number, because it can be changed into a prime (108586004613677) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5038315348 + ... + 5038336899.
It is an arithmetic number, because the mean of its divisors is an integer number (8502175334250).
Almost surely, 2108586004613672 is an apocalyptic number.
108586004613672 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
108586004613672 is an abundant number, since it is smaller than the sum of its proper divisors (163483606082328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108586004613672 is a wasteful number, since it uses less digits than its factorization.
108586004613672 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10076652705 (or 10076652701 counting only the distinct ones).
The product of its (nonzero) digits is 11612160, while the sum is 57.
The spelling of 108586004613672 in words is "one hundred eight trillion, five hundred eighty-six billion, four million, six hundred thirteen thousand, six hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •