Base | Representation |
---|---|
bin | 110010110101011011… |
… | …1011110101101001101 |
3 | 101102210001011211102221 |
4 | 1211222313132231031 |
5 | 3242033240022424 |
6 | 122052314015341 |
7 | 10613156063416 |
oct | 1455267365515 |
9 | 342701154387 |
10 | 109167110989 |
11 | 4232aa96292 |
12 | 191a7a17551 |
13 | a3a9aa0081 |
14 | 53d873680d |
15 | 2c8de259e4 |
hex | 196addeb4d |
109167110989 has 8 divisors (see below), whose sum is σ = 111972500640. Its totient is φ = 106373840496.
The previous prime is 109167110981. The next prime is 109167111019. The reversal of 109167110989 is 989011761901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 109167110989 - 23 = 109167110981 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (109167110981) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3011542 + ... + 3047575.
It is an arithmetic number, because the mean of its divisors is an integer number (13996562580).
Almost surely, 2109167110989 is an apocalyptic number.
It is an amenable number.
109167110989 is a deficient number, since it is larger than the sum of its proper divisors (2805389651).
109167110989 is an equidigital number, since it uses as much as digits as its factorization.
109167110989 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6059579.
The product of its (nonzero) digits is 244944, while the sum is 52.
The spelling of 109167110989 in words is "one hundred nine billion, one hundred sixty-seven million, one hundred ten thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •