Base | Representation |
---|---|
bin | 110001011010010111… |
… | …1101010110010001110 |
3 | 101010220002201022001120 |
4 | 1202310233222302032 |
5 | 3214304033004443 |
6 | 120425204021410 |
7 | 10444354542312 |
oct | 1426457526216 |
9 | 333802638046 |
10 | 106111609998 |
11 | 41002268159 |
12 | 18694691866 |
13 | a010a55614 |
14 | 51c8a03b42 |
15 | 2b60a6c083 |
hex | 18b4beac8e |
106111609998 has 8 divisors (see below), whose sum is σ = 212223220008. Its totient is φ = 35370536664.
The previous prime is 106111609993. The next prime is 106111609999. The reversal of 106111609998 is 899906111601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
106111609998 is an admirable number.
It is a super-2 number, since 2×1061116099982 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 106111609998.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106111609993) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8842634161 + ... + 8842634172.
It is an arithmetic number, because the mean of its divisors is an integer number (26527902501).
Almost surely, 2106111609998 is an apocalyptic number.
106111609998 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106111609998 is a wasteful number, since it uses less digits than its factorization.
106111609998 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17685268338.
The product of its (nonzero) digits is 209952, while the sum is 51.
The spelling of 106111609998 in words is "one hundred six billion, one hundred eleven million, six hundred nine thousand, nine hundred ninety-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •