Base | Representation |
---|---|
bin | 1100101101101… |
… | …01000110000000 |
3 | 21102200021110120 |
4 | 12112311012000 |
5 | 204300213221 |
6 | 14325500240 |
7 | 2433330633 |
oct | 626650600 |
9 | 242607416 |
10 | 106647936 |
11 | 5522219a |
12 | 2b871680 |
13 | 191306b5 |
14 | 10241c1a |
15 | 95695c6 |
hex | 65b5180 |
106647936 has 144 divisors (see below), whose sum is σ = 310948020. Its totient is φ = 32378880.
The previous prime is 106647923. The next prime is 106647943. The reversal of 106647936 is 639746601.
It is a super-2 number, since 2×1066479362 = 22747564506120192, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 3440241 + ... + 3440271.
Almost surely, 2106647936 is an apocalyptic number.
106647936 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 106647936, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155474010).
106647936 is an abundant number, since it is smaller than the sum of its proper divisors (204300084).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106647936 is an equidigital number, since it uses as much as digits as its factorization.
106647936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113 (or 53 counting only the distinct ones).
The product of its (nonzero) digits is 163296, while the sum is 42.
The square root of 106647936 is about 10327.0487555739. The cubic root of 106647936 is about 474.2246793975.
The spelling of 106647936 in words is "one hundred six million, six hundred forty-seven thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •