Base | Representation |
---|---|
bin | 110010111110010100… |
… | …0111011000000111111 |
3 | 101110112211020121211122 |
4 | 1211330220323000333 |
5 | 3243141103102141 |
6 | 122142044541155 |
7 | 10623436365431 |
oct | 1457450730077 |
9 | 343484217748 |
10 | 109465284671 |
11 | 42473332616 |
12 | 1926b8517bb |
13 | a4267ab7c2 |
14 | 5426192651 |
15 | 2caa1c364b |
hex | 197ca3b03f |
109465284671 has 2 divisors, whose sum is σ = 109465284672. Its totient is φ = 109465284670.
The previous prime is 109465284667. The next prime is 109465284707. The reversal of 109465284671 is 176482564901.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (176482564901) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 109465284671 - 22 = 109465284667 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (109465280671) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 54732642335 + 54732642336.
It is an arithmetic number, because the mean of its divisors is an integer number (54732642336).
Almost surely, 2109465284671 is an apocalyptic number.
109465284671 is a deficient number, since it is larger than the sum of its proper divisors (1).
109465284671 is an equidigital number, since it uses as much as digits as its factorization.
109465284671 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2903040, while the sum is 53.
The spelling of 109465284671 in words is "one hundred nine billion, four hundred sixty-five million, two hundred eighty-four thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •