Base | Representation |
---|---|
bin | 1101001001010… |
… | …10011000000000 |
3 | 21200111111120000 |
4 | 12210222120000 |
5 | 211212232143 |
6 | 14535320000 |
7 | 2506212453 |
oct | 644523000 |
9 | 250444500 |
10 | 110274048 |
11 | 57279585 |
12 | 30b20000 |
13 | 19b00021 |
14 | 1090749a |
15 | 9a33bd3 |
hex | 692a600 |
110274048 has 100 divisors (see below), whose sum is σ = 329262780. Its totient is φ = 36744192.
The previous prime is 110274013. The next prime is 110274067. The reversal of 110274048 is 840472011.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 40143 + ... + 42801.
Almost surely, 2110274048 is an apocalyptic number.
110274048 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 110274048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (164631390).
110274048 is an abundant number, since it is smaller than the sum of its proper divisors (218988732).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110274048 is an frugal number, since it uses more digits than its factorization.
110274048 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2689 (or 2664 counting only the distinct ones).
The product of its (nonzero) digits is 1792, while the sum is 27.
The square root of 110274048 is about 10501.1450804186. The cubic root of 110274048 is about 479.5395584612.
The spelling of 110274048 in words is "one hundred ten million, two hundred seventy-four thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •