Base | Representation |
---|---|
bin | 1100110000001… |
… | …10110000000000 |
3 | 21110022021021010 |
4 | 12120012300000 |
5 | 204341414100 |
6 | 14341000520 |
7 | 2436223020 |
oct | 630066000 |
9 | 243267233 |
10 | 106982400 |
11 | 55430508 |
12 | 2b9b3140 |
13 | 192199c5 |
14 | 102cba80 |
15 | 95d3750 |
hex | 6606c00 |
106982400 has 264 divisors, whose sum is σ = 406124800. Its totient is φ = 24330240.
The previous prime is 106982383. The next prime is 106982401. The reversal of 106982400 is 4289601.
It is a super-2 number, since 2×1069824002 = 22890467819520000, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106982401) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 537501 + ... + 537699.
Almost surely, 2106982400 is an apocalyptic number.
106982400 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 106982400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (203062400).
106982400 is an abundant number, since it is smaller than the sum of its proper divisors (299142400).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106982400 is a wasteful number, since it uses less digits than its factorization.
106982400 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 239 (or 216 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 30.
The square root of 106982400 is about 10343.2296696922. The cubic root of 106982400 is about 474.7199087411.
The spelling of 106982400 in words is "one hundred six million, nine hundred eighty-two thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.060 sec. • engine limits •