Base | Representation |
---|---|
bin | 110010110010100101… |
… | …1011001000110010001 |
3 | 101102112101120210201122 |
4 | 1211211023121012101 |
5 | 3241334321330401 |
6 | 122035024212025 |
7 | 10610616610001 |
oct | 1454513310621 |
9 | 342471523648 |
10 | 109071667601 |
11 | 42291127256 |
12 | 1917ba6a015 |
13 | a3930935b0 |
14 | 53c9bb0001 |
15 | 2c8587121b |
hex | 19652d9191 |
109071667601 has 8 divisors (see below), whose sum is σ = 118624785384. Its totient is φ = 99684691200.
The previous prime is 109071667517. The next prime is 109071667619. The reversal of 109071667601 is 106766170901.
It is a Cunningham number, because it is equal to 3302602+1.
It can be written as a sum of positive squares in 4 ways, for example, as 16135096576 + 92936571025 = 127024^2 + 304855^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-109071667601 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (109071667631) 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, 41533976 + ... + 41536601.
It is an arithmetic number, because the mean of its divisors is an integer number (14828098173).
Almost surely, 2109071667601 is an apocalyptic number.
It is an amenable number.
109071667601 is a deficient number, since it is larger than the sum of its proper divisors (9553117783).
109071667601 is a wasteful number, since it uses less digits than its factorization.
109071667601 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 83070691.
The product of its (nonzero) digits is 95256, while the sum is 44.
The spelling of 109071667601 in words is "one hundred nine billion, seventy-one million, six hundred sixty-seven thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •