Base | Representation |
---|---|
bin | 1100110000001… |
… | …11010011000000 |
3 | 21110022101100002 |
4 | 12120013103000 |
5 | 204342002030 |
6 | 14341015132 |
7 | 2436232400 |
oct | 630072300 |
9 | 243271302 |
10 | 106984640 |
11 | 55432164 |
12 | 2b9b44a8 |
13 | 1921aa29 |
14 | 102cc800 |
15 | 95d4245 |
hex | 66074c0 |
106984640 has 84 divisors (see below), whose sum is σ = 296393616. Its totient is φ = 36675072.
The previous prime is 106984637. The next prime is 106984651. The reversal of 106984640 is 46489601.
It is a super-3 number, since 3×1069846403 (a number of 25 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 106984594 and 106984603.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12269 + ... + 19091.
Almost surely, 2106984640 is an apocalyptic number.
106984640 is a gapful number since it is divisible by the number (10) 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 106984640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (148196808).
106984640 is an abundant number, since it is smaller than the sum of its proper divisors (189408976).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106984640 is an equidigital number, since it uses as much as digits as its factorization.
106984640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6854 (or 6837 counting only the distinct ones).
The product of its (nonzero) digits is 41472, while the sum is 38.
The square root of 106984640 is about 10343.3379525180. The cubic root of 106984640 is about 474.7232219502.
The spelling of 106984640 in words is "one hundred six million, nine hundred eighty-four thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.101 sec. • engine limits •