Base | Representation |
---|---|
bin | 110001100000010101… |
… | …0001111000111001101 |
3 | 101011102000212101202212 |
4 | 1203000222033013031 |
5 | 3220211221400100 |
6 | 120501104400205 |
7 | 10452332642441 |
oct | 1430052170715 |
9 | 334360771685 |
10 | 106311512525 |
11 | 410a5093959 |
12 | 1872b616065 |
13 | a0432a743a |
14 | 520739c821 |
15 | 2b733a7635 |
hex | 18c0a8f1cd |
106311512525 has 48 divisors (see below), whose sum is σ = 145329984000. Its totient is φ = 76874434560.
The previous prime is 106311512513. The next prime is 106311512539. The reversal of 106311512525 is 525215113601.
It is not a de Polignac number, because 106311512525 - 214 = 106311496141 is a prime.
It is a super-2 number, since 2×1063115125252 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106311512491 and 106311512500.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 715901 + ... + 851549.
It is an arithmetic number, because the mean of its divisors is an integer number (3027708000).
Almost surely, 2106311512525 is an apocalyptic number.
It is an amenable number.
106311512525 is a deficient number, since it is larger than the sum of its proper divisors (39018471475).
106311512525 is a wasteful number, since it uses less digits than its factorization.
106311512525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 135758 (or 135753 counting only the distinct ones).
The product of its (nonzero) digits is 9000, while the sum is 32.
The spelling of 106311512525 in words is "one hundred six billion, three hundred eleven million, five hundred twelve thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.114 sec. • engine limits •