Base | Representation |
---|---|
bin | 1100101100100… |
… | …10111000110110 |
3 | 21102102011021110 |
4 | 12112102320312 |
5 | 204231222310 |
6 | 14322455450 |
7 | 2432205312 |
oct | 626227066 |
9 | 242364243 |
10 | 106507830 |
11 | 55136a00 |
12 | 2b804586 |
13 | 190b19b0 |
14 | 10206b42 |
15 | 953cd20 |
hex | 6592e36 |
106507830 has 192 divisors, whose sum is σ = 315854784. Its totient is φ = 22809600.
The previous prime is 106507799. The next prime is 106507883. The reversal of 106507830 is 38705601.
It is a super-2 number, since 2×1065078302 = 22687835702617800, 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 an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 1746000 + ... + 1746060.
It is an arithmetic number, because the mean of its divisors is an integer number (1645077).
Almost surely, 2106507830 is an apocalyptic number.
106507830 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 106507830, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157927392).
106507830 is an abundant number, since it is smaller than the sum of its proper divisors (209346954).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
106507830 is a wasteful number, since it uses less digits than its factorization.
106507830 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 143 (or 132 counting only the distinct ones).
The product of its (nonzero) digits is 5040, while the sum is 30.
The square root of 106507830 is about 10320.2630780421. The cubic root of 106507830 is about 474.0169215416.
The spelling of 106507830 in words is "one hundred six million, five hundred seven thousand, eight hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •