Base | Representation |
---|---|
bin | 110011010010001011… |
… | …1111100000100000000 |
3 | 101112021021122021011200 |
4 | 1212210113330010000 |
5 | 3301022232434102 |
6 | 122332141141200 |
7 | 10646112612141 |
oct | 1464427740400 |
9 | 345237567150 |
10 | 110131921152 |
11 | 42785664460 |
12 | 19416b5a800 |
13 | a501938c66 |
14 | 548a923ac8 |
15 | 2ce89a551c |
hex | 19a45fc100 |
110131921152 has 216 divisors, whose sum is σ = 347610227328. Its totient is φ = 33257164800.
The previous prime is 110131921103. The next prime is 110131921199. The reversal of 110131921152 is 251129131011.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 7418377 + ... + 7433207.
It is an arithmetic number, because the mean of its divisors is an integer number (1609306608).
Almost surely, 2110131921152 is an apocalyptic number.
110131921152 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 110131921152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (173805113664).
110131921152 is an abundant number, since it is smaller than the sum of its proper divisors (237478306176).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110131921152 is a wasteful number, since it uses less digits than its factorization.
110131921152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15157 (or 15140 counting only the distinct ones).
The product of its (nonzero) digits is 540, while the sum is 27.
The spelling of 110131921152 in words is "one hundred ten billion, one hundred thirty-one million, nine hundred twenty-one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •