Base | Representation |
---|---|
bin | 1100111001101… |
… | …11010000000000 |
3 | 21112122122010220 |
4 | 12130313100000 |
5 | 210201322012 |
6 | 14423423040 |
7 | 2452636200 |
oct | 634672000 |
9 | 245578126 |
10 | 108229632 |
11 | 56102585 |
12 | 302b4a80 |
13 | 19565604 |
14 | 10534400 |
15 | 977d08c |
hex | 6737400 |
108229632 has 132 divisors (see below), whose sum is σ = 336035520. Its totient is φ = 30879744.
The previous prime is 108229613. The next prime is 108229661. The reversal of 108229632 is 236922801.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 108229593 and 108229602.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 150169 + ... + 150887.
Almost surely, 2108229632 is an apocalyptic number.
108229632 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 108229632, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (168017760).
108229632 is an abundant number, since it is smaller than the sum of its proper divisors (227805888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
108229632 is an equidigital number, since it uses as much as digits as its factorization.
108229632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 756 (or 731 counting only the distinct ones).
The product of its (nonzero) digits is 10368, while the sum is 33.
The square root of 108229632 is about 10403.3471536809. The cubic root of 108229632 is about 476.5575934000.
The spelling of 108229632 in words is "one hundred eight million, two hundred twenty-nine thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •