Base | Representation |
---|---|
bin | 110001011010010101… |
… | …1011110010000011001 |
3 | 101010220000122102021210 |
4 | 1202310223132100121 |
5 | 3214303242310410 |
6 | 120425124253333 |
7 | 10444342311525 |
oct | 1426453362031 |
9 | 333800572253 |
10 | 106110510105 |
11 | 41001686856 |
12 | 18694241249 |
13 | a01075bab2 |
14 | 51c87d8d85 |
15 | 2b60901220 |
hex | 18b4ade419 |
106110510105 has 8 divisors (see below), whose sum is σ = 169776816192. Its totient is φ = 56592272048.
The previous prime is 106110510089. The next prime is 106110510109. The reversal of 106110510105 is 501015011601.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 106110510105 - 24 = 106110510089 is a prime.
It is a super-2 number, since 2×1061105101052 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (106110510109) 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, 3537016989 + ... + 3537017018.
It is an arithmetic number, because the mean of its divisors is an integer number (21222102024).
Almost surely, 2106110510105 is an apocalyptic number.
106110510105 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
106110510105 is a deficient number, since it is larger than the sum of its proper divisors (63666306087).
106110510105 is an equidigital number, since it uses as much as digits as its factorization.
106110510105 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7074034015.
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 106110510105 its reverse (501015011601), we get a palindrome (607125521706).
The spelling of 106110510105 in words is "one hundred six billion, one hundred ten million, five hundred ten thousand, one hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •