Base | Representation |
---|---|
bin | 1100110100101… |
… | …00100010000000 |
3 | 21111101202212212 |
4 | 12122110202000 |
5 | 210014010021 |
6 | 14401241252 |
7 | 2444162102 |
oct | 632244200 |
9 | 244352785 |
10 | 107563136 |
11 | 5579785a |
12 | 30033228 |
13 | 19391135 |
14 | 103dd572 |
15 | 969a85b |
hex | 6694880 |
107563136 has 32 divisors (see below), whose sum is σ = 217933200. Its totient is φ = 52866304.
The previous prime is 107563109. The next prime is 107563139. The reversal of 107563136 is 631365701.
It is a tau number, because it is divible by the number of its divisors (32).
It is a Harshad number since it is a multiple of its sum of digits (32).
It is not an unprimeable number, because it can be changed into a prime (107563139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 431 + ... + 14673.
Almost surely, 2107563136 is an apocalyptic number.
107563136 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 107563136, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (108966600).
107563136 is an abundant number, since it is smaller than the sum of its proper divisors (110370064).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107563136 is an equidigital number, since it uses as much as digits as its factorization.
107563136 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14316 (or 14304 counting only the distinct ones).
The product of its (nonzero) digits is 11340, while the sum is 32.
The square root of 107563136 is about 10371.2649180319. The cubic root of 107563136 is about 475.5773382491.
The spelling of 107563136 in words is "one hundred seven million, five hundred sixty-three thousand, one hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •