Base | Representation |
---|---|
bin | 110011000110011110… |
… | …1011011110110111000 |
3 | 101111020220110202110120 |
4 | 1212030331123312320 |
5 | 3244221202110103 |
6 | 122225145413240 |
7 | 10633302636564 |
oct | 1461475336670 |
9 | 344226422416 |
10 | 109739097528 |
11 | 425a3950235 |
12 | 1932749a220 |
13 | a46b43ac48 |
14 | 54506aa6a4 |
15 | 2cc425d253 |
hex | 198cf5bdb8 |
109739097528 has 128 divisors (see below), whose sum is σ = 286268774400. Its totient is φ = 35017113600.
The previous prime is 109739097521. The next prime is 109739097623. The reversal of 109739097528 is 825790937901.
It is a Smith number, since the sum of its digits (60) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109739097521) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 58092808 + ... + 58094696.
It is an arithmetic number, because the mean of its divisors is an integer number (2236474800).
Almost surely, 2109739097528 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 109739097528, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (143134387200).
109739097528 is an abundant number, since it is smaller than the sum of its proper divisors (176529676872).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109739097528 is a wasteful number, since it uses less digits than its factorization.
109739097528 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2733 (or 2729 counting only the distinct ones).
The product of its (nonzero) digits is 8573040, while the sum is 60.
The spelling of 109739097528 in words is "one hundred nine billion, seven hundred thirty-nine million, ninety-seven thousand, five hundred twenty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •