Base | Representation |
---|---|
bin | 1101000100100… |
… | …00001110001000 |
3 | 21122022102102020 |
4 | 12202100032020 |
5 | 211032031012 |
6 | 14514004440 |
7 | 2500642551 |
oct | 642201610 |
9 | 248272366 |
10 | 109642632 |
11 | 56988150 |
12 | 30876720 |
13 | 1993b7c8 |
14 | 107c1328 |
15 | 995ba8c |
hex | 6890388 |
109642632 has 64 divisors (see below), whose sum is σ = 300672000. Its totient is φ = 33042240.
The previous prime is 109642583. The next prime is 109642667. The reversal of 109642632 is 236246901.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is a junction number, because it is equal to n+sod(n) for n = 109642593 and 109642602.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 51493 + ... + 53579.
It is an arithmetic number, because the mean of its divisors is an integer number (4698000).
Almost surely, 2109642632 is an apocalyptic number.
109642632 is a gapful number since it is divisible by the number (12) 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 109642632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (150336000).
109642632 is an abundant number, since it is smaller than the sum of its proper divisors (191029368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109642632 is a wasteful number, since it uses less digits than its factorization.
109642632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2306 (or 2302 counting only the distinct ones).
The product of its (nonzero) digits is 15552, while the sum is 33.
The square root of 109642632 is about 10471.0377709184. The cubic root of 109642632 is about 478.6225439510.
The spelling of 109642632 in words is "one hundred nine million, six hundred forty-two thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •