Base | Representation |
---|---|
bin | 1101001001000… |
… | …10100011110000 |
3 | 21200102212122020 |
4 | 12210202203300 |
5 | 211210221112 |
6 | 14534511440 |
7 | 2506020225 |
oct | 644424360 |
9 | 250385566 |
10 | 110242032 |
11 | 5725751a |
12 | 30b05580 |
13 | 19abb594 |
14 | 108d994c |
15 | 9a2948c |
hex | 69228f0 |
110242032 has 40 divisors (see below), whose sum is σ = 286387920. Its totient is φ = 36541440.
The previous prime is 110242019. The next prime is 110242039. The reversal of 110242032 is 230242011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110242039) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 2344 + ... + 15032.
It is an arithmetic number, because the mean of its divisors is an integer number (7159698).
Almost surely, 2110242032 is an apocalyptic number.
110242032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110242032 is an abundant number, since it is smaller than the sum of its proper divisors (176145888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110242032 is a wasteful number, since it uses less digits than its factorization.
110242032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12881 (or 12875 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 15.
The square root of 110242032 is about 10499.6205645728. The cubic root of 110242032 is about 479.4931455326.
Adding to 110242032 its reverse (230242011), we get a palindrome (340484043).
It can be divided in two parts, 1102 and 42032, that added together give a palindrome (43134).
The spelling of 110242032 in words is "one hundred ten million, two hundred forty-two thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •