Base | Representation |
---|---|
bin | 11000010110000001100101… |
… | …001011111111101111010101 |
3 | 112001002110201101201002201001 |
4 | 120112001211023333233111 |
5 | 103013134440423220130 |
6 | 1015413423030103301 |
7 | 31360211131351462 |
oct | 3026014513775725 |
9 | 461073641632631 |
10 | 107066642398165 |
11 | 3112978745963a |
12 | 10012295aaab31 |
13 | 47984583b9368 |
14 | 1c620a5b6c669 |
15 | c5a0b094e6ca |
hex | 6160652ffbd5 |
107066642398165 has 16 divisors (see below), whose sum is σ = 128654153043840. Its totient is φ = 85537210973760.
The previous prime is 107066642398123. The next prime is 107066642398181. The reversal of 107066642398165 is 561893246660701.
It is a de Polignac number, because none of the positive numbers 2k-107066642398165 is a prime.
It is a super-2 number, since 2×1070666423981652 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 107066642398097 and 107066642398106.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 45405091 + ... + 47704879.
It is an arithmetic number, because the mean of its divisors is an integer number (8040884565240).
It is a 1-persistent number, because it is pandigital, but 2⋅107066642398165 = 214133284796330 is not.
Almost surely, 2107066642398165 is an apocalyptic number.
It is an amenable number.
107066642398165 is a deficient number, since it is larger than the sum of its proper divisors (21587510645675).
107066642398165 is a wasteful number, since it uses less digits than its factorization.
107066642398165 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2312412.
The product of its (nonzero) digits is 78382080, while the sum is 64.
The spelling of 107066642398165 in words is "one hundred seven trillion, sixty-six billion, six hundred forty-two million, three hundred ninety-eight thousand, one hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •