Base | Representation |
---|---|
bin | 1100101101101… |
… | …00000111001100 |
3 | 21102200001221200 |
4 | 12112310013030 |
5 | 204300101131 |
6 | 14325425500 |
7 | 2433313131 |
oct | 626640714 |
9 | 242601850 |
10 | 106643916 |
11 | 5521a175 |
12 | 2b86b290 |
13 | 1912b912 |
14 | 10240588 |
15 | 95682e6 |
hex | 65b41cc |
106643916 has 108 divisors (see below), whose sum is σ = 293874672. Its totient is φ = 32522688.
The previous prime is 106643909. The next prime is 106643989. The reversal of 106643916 is 619346601.
106643916 is a `hidden beast` number, since 1 + 0 + 6 + 643 + 9 + 1 + 6 = 666.
It is a super-2 number, since 2×1066439162 = 22745849639630112, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
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 35 ways as a sum of consecutive naturals, for example, 1807495 + ... + 1807553.
Almost surely, 2106643916 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106643916, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146937336).
106643916 is an abundant number, since it is smaller than the sum of its proper divisors (187230756).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106643916 is a wasteful number, since it uses less digits than its factorization.
106643916 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188 (or 124 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 36.
The square root of 106643916 is about 10326.8541192369. The cubic root of 106643916 is about 474.2187208288.
The spelling of 106643916 in words is "one hundred six million, six hundred forty-three thousand, nine hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •