Base | Representation |
---|---|
bin | 1100101001111… |
… | …11010101111111 |
3 | 21101202202212102 |
4 | 12110333111333 |
5 | 204134300011 |
6 | 14311255315 |
7 | 2426251535 |
oct | 624772577 |
9 | 241682772 |
10 | 106165631 |
11 | 54a228a0 |
12 | 2b67a53b |
13 | 18cc2000 |
14 | 10158155 |
15 | 94c173b |
hex | 653f57f |
106165631 has 32 divisors (see below), whose sum is σ = 131604480. Its totient is φ = 84770400.
The previous prime is 106165573. The next prime is 106165639. The reversal of 106165631 is 136561601.
It is not a de Polignac number, because 106165631 - 26 = 106165567 is a prime.
It is a super-2 number, since 2×1061656312 = 22542282411256322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 106165594 and 106165603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106165639) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 555746 + ... + 555936.
It is an arithmetic number, because the mean of its divisors is an integer number (4112640).
Almost surely, 2106165631 is an apocalyptic number.
106165631 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
106165631 is a deficient number, since it is larger than the sum of its proper divisors (25438849).
106165631 is a wasteful number, since it uses less digits than its factorization.
106165631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 264 (or 238 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 29.
The square root of 106165631 is about 10303.6707536683. The cubic root of 106165631 is about 473.5087205741.
The spelling of 106165631 in words is "one hundred six million, one hundred sixty-five thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •