Base | Representation |
---|---|
bin | 1101000101000… |
… | …10010111110100 |
3 | 21122110012101212 |
4 | 12202202113310 |
5 | 211041420410 |
6 | 14515340552 |
7 | 2501402402 |
oct | 642422764 |
9 | 248405355 |
10 | 109716980 |
11 | 56a28a9a |
12 | 308b1758 |
13 | 199665b9 |
14 | 10800472 |
15 | 9973b05 |
hex | 68a25f4 |
109716980 has 48 divisors (see below), whose sum is σ = 244835136. Its totient is φ = 41157120.
The previous prime is 109716977. The next prime is 109717021. The reversal of 109716980 is 89617901.
It is a happy number.
It is a congruent number.
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 15 ways as a sum of consecutive naturals, for example, 158435 + ... + 159125.
It is an arithmetic number, because the mean of its divisors is an integer number (5100732).
Almost surely, 2109716980 is an apocalyptic number.
109716980 is a gapful number since it is divisible by the number (10) 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 109716980, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (122417568).
109716980 is an abundant number, since it is smaller than the sum of its proper divisors (135118156).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
109716980 is a wasteful number, since it uses less digits than its factorization.
109716980 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1184 (or 1182 counting only the distinct ones).
The product of its (nonzero) digits is 27216, while the sum is 41.
The square root of 109716980 is about 10474.5873427071. The cubic root of 109716980 is about 478.7307031832.
The spelling of 109716980 in words is "one hundred nine million, seven hundred sixteen thousand, nine hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •