Base | Representation |
---|---|
bin | 110010110001101001… |
… | …0011001011100000000 |
3 | 101102110011220100202200 |
4 | 1211203102121130000 |
5 | 3241303211341233 |
6 | 122031532313200 |
7 | 10610053164414 |
oct | 1454322313400 |
9 | 342404810680 |
10 | 109039949568 |
11 | 42275233000 |
12 | 19171312800 |
13 | a389639624 |
14 | 53c58b4d44 |
15 | 2c82ba8313 |
hex | 1963499700 |
109039949568 has 648 divisors, whose sum is σ = 366976432368. Its totient is φ = 31112294400.
The previous prime is 109039949507. The next prime is 109039949581. The reversal of 109039949568 is 865949930901.
109039949568 is a `hidden beast` number, since 10 + 90 + 399 + 4 + 95 + 68 = 666.
It is a super-3 number, since 3×1090399495683 (a number of 34 digits) contains 333 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 2947025646 + ... + 2947025682.
Almost surely, 2109039949568 is an apocalyptic number.
109039949568 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 109039949568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (183488216184).
109039949568 is an abundant number, since it is smaller than the sum of its proper divisors (257936482800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109039949568 is an equidigital number, since it uses as much as digits as its factorization.
109039949568 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154 (or 84 counting only the distinct ones).
The product of its (nonzero) digits is 18895680, while the sum is 63.
The spelling of 109039949568 in words is "one hundred nine billion, thirty-nine million, nine hundred forty-nine thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •