Base | Representation |
---|---|
bin | 110010110100100101… |
… | …0100101110111000000 |
3 | 101102201001110121220001 |
4 | 1211221022211313000 |
5 | 3242003433112332 |
6 | 122045414125344 |
7 | 10612361336536 |
oct | 1455112456700 |
9 | 342631417801 |
10 | 109138566592 |
11 | 4231596a480 |
12 | 1919a350854 |
13 | a3a3bb77b3 |
14 | 53d4a26156 |
15 | 2c8b6880e7 |
hex | 19692a5dc0 |
109138566592 has 112 divisors (see below), whose sum is σ = 245644416000. Its totient is φ = 47655336960.
The previous prime is 109138566547. The next prime is 109138566623. The reversal of 109138566592 is 295665831901.
It is a super-2 number, since 2×1091385665922 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4049353 + ... + 4076215.
Almost surely, 2109138566592 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 109138566592, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122822208000).
109138566592 is an abundant number, since it is smaller than the sum of its proper divisors (136505849408).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109138566592 is a wasteful number, since it uses less digits than its factorization.
109138566592 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 27114 (or 27104 counting only the distinct ones).
The product of its (nonzero) digits is 3499200, while the sum is 55.
The spelling of 109138566592 in words is "one hundred nine billion, one hundred thirty-eight million, five hundred sixty-six thousand, five hundred ninety-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •