Base | Representation |
---|---|
bin | 110011000010101100… |
… | …0110011000110011001 |
3 | 101110221001102012222120 |
4 | 1212011120303012121 |
5 | 3243441141143024 |
6 | 122204410411453 |
7 | 10630201035213 |
oct | 1460530630631 |
9 | 343831365876 |
10 | 109612052889 |
11 | 42539167769 |
12 | 192b0a30b89 |
13 | a44b0186c1 |
14 | 543b8795b3 |
15 | 2cb8015479 |
hex | 1985633199 |
109612052889 has 8 divisors (see below), whose sum is σ = 154746427680. Its totient is φ = 68776190016.
The previous prime is 109612052881. The next prime is 109612052909. The reversal of 109612052889 is 988250216901.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 109612052889 - 23 = 109612052881 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (51), and also a Moran number because the ratio is a prime number: 2149255939 = 109612052889 / (1 + 0 + 9 + 6 + 1 + 2 + 0 + 5 + 2 + 8 + 8 + 9).
It is not an unprimeable number, because it can be changed into a prime (109612052881) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1074627919 + ... + 1074628020.
It is an arithmetic number, because the mean of its divisors is an integer number (19343303460).
Almost surely, 2109612052889 is an apocalyptic number.
It is an amenable number.
109612052889 is a deficient number, since it is larger than the sum of its proper divisors (45134374791).
109612052889 is a wasteful number, since it uses less digits than its factorization.
109612052889 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2149255959.
The product of its (nonzero) digits is 622080, while the sum is 51.
The spelling of 109612052889 in words is "one hundred nine billion, six hundred twelve million, fifty-two thousand, eight hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •