Base | Representation |
---|---|
bin | 110010110011111010… |
… | …1110110110100010000 |
3 | 101102122111200002200100 |
4 | 1211213311312310100 |
5 | 3241432241310213 |
6 | 122043302052400 |
7 | 10612001463330 |
oct | 1454765666420 |
9 | 342574602610 |
10 | 109116353808 |
11 | 42304378700 |
12 | 19192a1a100 |
13 | a39c40b137 |
14 | 53d1ac30c0 |
15 | 2c8974b773 |
hex | 1967d76d10 |
109116353808 has 720 divisors, whose sum is σ = 405424551168. Its totient is φ = 26763264000.
The previous prime is 109116353779. The next prime is 109116353869. The reversal of 109116353808 is 808353611901.
It is a happy number.
109116353808 is a `hidden beast` number, since 1 + 0 + 9 + 1 + 1 + 635 + 3 + 8 + 0 + 8 = 666.
It is a super-2 number, since 2×1091163538082 (a number of 23 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 272110408 + ... + 272110808.
Almost surely, 2109116353808 is an apocalyptic number.
109116353808 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 109116353808, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (202712275584).
109116353808 is an abundant number, since it is smaller than the sum of its proper divisors (296308197360).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109116353808 is a wasteful number, since it uses less digits than its factorization.
109116353808 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 564 (or 544 counting only the distinct ones).
The product of its (nonzero) digits is 155520, while the sum is 45.
The spelling of 109116353808 in words is "one hundred nine billion, one hundred sixteen million, three hundred fifty-three thousand, eight hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •