Base | Representation |
---|---|
bin | 11000101101100111101000… |
… | …011101101110001001110101 |
3 | 112020211110211220111222021120 |
4 | 120231213220131232021311 |
5 | 103221221110131434423 |
6 | 1023054333313134153 |
7 | 31615311065522505 |
oct | 3055475035561165 |
9 | 466743756458246 |
10 | 108688047530613 |
11 | 316a4384380931 |
12 | 1023457b25a359 |
13 | 4885314b44935 |
14 | 1cba75b1cba05 |
15 | c8735b309ee3 |
hex | 62d9e876e275 |
108688047530613 has 8 divisors (see below), whose sum is σ = 144917815445568. Its totient is φ = 72458488984704.
The previous prime is 108688047530603. The next prime is 108688047530677. The reversal of 108688047530613 is 316035740886801.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 108688047530613 - 26 = 108688047530549 is a prime.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (108688047530603) 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, 51126945 + ... + 53210342.
It is an arithmetic number, because the mean of its divisors is an integer number (18114726930696).
Almost surely, 2108688047530613 is an apocalyptic number.
It is an amenable number.
108688047530613 is a deficient number, since it is larger than the sum of its proper divisors (36229767914955).
108688047530613 is a wasteful number, since it uses less digits than its factorization.
108688047530613 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 104684523.
The product of its (nonzero) digits is 23224320, while the sum is 60.
The spelling of 108688047530613 in words is "one hundred eight trillion, six hundred eighty-eight billion, forty-seven million, five hundred thirty thousand, six hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •