Base | Representation |
---|---|
bin | 110010110101000101… |
… | …0101000000011000000 |
3 | 101102202020001110012021 |
4 | 1211222022220003000 |
5 | 3242022232242033 |
6 | 122051214011224 |
7 | 10612654122040 |
oct | 1455212500300 |
9 | 342666043167 |
10 | 109155352768 |
11 | 42324395150 |
12 | 191a3aa6b14 |
13 | a3a7514147 |
14 | 53d6d55720 |
15 | 2c8cda1b2d |
hex | 196a2a80c0 |
109155352768 has 448 divisors, whose sum is σ = 295977673728. Its totient is φ = 38645268480.
The previous prime is 109155352759. The next prime is 109155352771. The reversal of 109155352768 is 867253551901.
It is a happy number.
It is a tau number, because it is divible by the number of its divisors (448).
It is a hoax number, since the sum of its digits (52) coincides with the sum of the digits of its distinct prime factors.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 565571680 + ... + 565571872.
Almost surely, 2109155352768 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 109155352768, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (147988836864).
109155352768 is an abundant number, since it is smaller than the sum of its proper divisors (186822320960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109155352768 is a wasteful number, since it uses less digits than its factorization.
109155352768 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 440 (or 430 counting only the distinct ones).
The product of its (nonzero) digits is 2268000, while the sum is 52.
The spelling of 109155352768 in words is "one hundred nine billion, one hundred fifty-five million, three hundred fifty-two thousand, seven hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •