Base | Representation |
---|---|
bin | 110010110100111110… |
… | …1011000011111100100 |
3 | 101102201222112002002020 |
4 | 1211221331120133210 |
5 | 3242020340144223 |
6 | 122051011343140 |
7 | 10612612452600 |
oct | 1455175303744 |
9 | 342658462066 |
10 | 109151881188 |
11 | 42322433979 |
12 | 191a28b1ab0 |
13 | a3a6899c5c |
14 | 53d66d0500 |
15 | 2c8c9181e3 |
hex | 1969f587e4 |
109151881188 has 144 divisors (see below), whose sum is σ = 322617355200. Its totient is φ = 28525996800.
The previous prime is 109151881183. The next prime is 109151881219. The reversal of 109151881188 is 881188151901.
It is a happy number.
It is a self number, because there is not a number n which added to its sum of digits gives 109151881188.
It is not an unprimeable number, because it can be changed into a prime (109151881183) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 155538 + ... + 492438.
It is an arithmetic number, because the mean of its divisors is an integer number (2240398300).
Almost surely, 2109151881188 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 109151881188, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161308677600).
109151881188 is an abundant number, since it is smaller than the sum of its proper divisors (213465474012).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109151881188 is a wasteful number, since it uses less digits than its factorization.
109151881188 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 336970 (or 336961 counting only the distinct ones).
The product of its (nonzero) digits is 184320, while the sum is 51.
The spelling of 109151881188 in words is "one hundred nine billion, one hundred fifty-one million, eight hundred eighty-one thousand, one hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •