Base | Representation |
---|---|
bin | 1100110011001… |
… | …00111011000000 |
3 | 21111000212101100 |
4 | 12121210323000 |
5 | 204441240003 |
6 | 14353134400 |
7 | 2442420420 |
oct | 631447300 |
9 | 244025340 |
10 | 107368128 |
11 | 5567429a |
12 | 2bb5a400 |
13 | 1932344a |
14 | 1038c480 |
15 | 965cba3 |
hex | 6664ec0 |
107368128 has 168 divisors, whose sum is σ = 363484160. Its totient is φ = 29652480.
The previous prime is 107368111. The next prime is 107368139. The reversal of 107368128 is 821863701.
It is a tau number, because it is divible by the number of its divisors (168).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a junction number, because it is equal to n+sod(n) for n = 107368092 and 107368101.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 124563 + ... + 125421.
Almost surely, 2107368128 is an apocalyptic number.
107368128 is a gapful number since it is divisible by the number (18) 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 107368128, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (181742080).
107368128 is an abundant number, since it is smaller than the sum of its proper divisors (256116032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107368128 is a wasteful number, since it uses less digits than its factorization.
107368128 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 915 (or 902 counting only the distinct ones).
The product of its (nonzero) digits is 16128, while the sum is 36.
The square root of 107368128 is about 10361.8592926173. The cubic root of 107368128 is about 475.2897629976.
The spelling of 107368128 in words is "one hundred seven million, three hundred sixty-eight thousand, one hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •