Base | Representation |
---|---|
bin | 110001100010101101… |
… | …1100100001011111110 |
3 | 101011121121110212100020 |
4 | 1203011123210023332 |
5 | 3220342214142031 |
6 | 120513044113010 |
7 | 10454324164062 |
oct | 1430533441376 |
9 | 334547425306 |
10 | 106391552766 |
11 | 41136292314 |
12 | 18752395766 |
13 | a056a4cc25 |
14 | 5213c75aa2 |
15 | 2b7a418096 |
hex | 18c56e42fe |
106391552766 has 8 divisors (see below), whose sum is σ = 212783105544. Its totient is φ = 35463850920.
The previous prime is 106391552689. The next prime is 106391552767. The reversal of 106391552766 is 667255193601.
It is a sphenic number, since it is the product of 3 distinct primes.
106391552766 is an admirable number.
It is a super-2 number, since 2×1063915527662 (a number of 23 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (51) 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 (106391552767) 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, 8865962725 + ... + 8865962736.
It is an arithmetic number, because the mean of its divisors is an integer number (26597888193).
Almost surely, 2106391552766 is an apocalyptic number.
106391552766 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.
106391552766 is a wasteful number, since it uses less digits than its factorization.
106391552766 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17731925466.
The product of its (nonzero) digits is 2041200, while the sum is 51.
The spelling of 106391552766 in words is "one hundred six billion, three hundred ninety-one million, five hundred fifty-two thousand, seven hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •