Base | Representation |
---|---|
bin | 1100101101100… |
… | …10110001010001 |
3 | 21102122210102000 |
4 | 12112302301101 |
5 | 204244412132 |
6 | 14325344213 |
7 | 2433261114 |
oct | 626626121 |
9 | 242583360 |
10 | 106638417 |
11 | 55216026 |
12 | 2b868069 |
13 | 19129272 |
14 | 1023c57b |
15 | 956687c |
hex | 65b2c51 |
106638417 has 16 divisors (see below), whose sum is σ = 161837760. Its totient is φ = 69357600.
The previous prime is 106638401. The next prime is 106638421. The reversal of 106638417 is 714836601.
106638417 is a `hidden beast` number, since 1 + 0 + 6 + 638 + 4 + 17 = 666.
It is not a de Polignac number, because 106638417 - 24 = 106638401 is a prime.
It is a super-2 number, since 2×1066384172 = 22743503960531778, which contains 22 as substring.
It is a Smith number, since the sum of its digits (36) coincides with the sum of the digits of its prime factors.
It is not an unprimeable number, because it can be changed into a prime (106638457) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47059 + ... + 49272.
It is an arithmetic number, because the mean of its divisors is an integer number (10114860).
Almost surely, 2106638417 is an apocalyptic number.
It is an amenable number.
106638417 is a deficient number, since it is larger than the sum of its proper divisors (55199343).
106638417 is an equidigital number, since it uses as much as digits as its factorization.
106638417 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96381 (or 96375 counting only the distinct ones).
The product of its (nonzero) digits is 24192, while the sum is 36.
The square root of 106638417 is about 10326.5878682167. The cubic root of 106638417 is about 474.2105697978.
The spelling of 106638417 in words is "one hundred six million, six hundred thirty-eight thousand, four hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •