Base | Representation |
---|---|
bin | 110001111001101000… |
… | …0000110101111100101 |
3 | 101020121012000022000011 |
4 | 1203303100012233211 |
5 | 3223431014104032 |
6 | 121121225050221 |
7 | 10512350345134 |
oct | 1436320065745 |
9 | 336535008004 |
10 | 107160300517 |
11 | 414a0217936 |
12 | 18927926971 |
13 | a14a0acb5a |
14 | 5287dc791b |
15 | 2bc2b6a247 |
hex | 18f3406be5 |
107160300517 has 4 divisors (see below), whose sum is σ = 107164395360. Its totient is φ = 107156205676.
The previous prime is 107160300493. The next prime is 107160300529. The reversal of 107160300517 is 715003061701.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107160300517 is a prime.
It is a super-2 number, since 2×1071603005172 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107160309517) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2007913 + ... + 2060590.
It is an arithmetic number, because the mean of its divisors is an integer number (26791098840).
Almost surely, 2107160300517 is an apocalyptic number.
It is an amenable number.
107160300517 is a deficient number, since it is larger than the sum of its proper divisors (4094843).
107160300517 is an equidigital number, since it uses as much as digits as its factorization.
107160300517 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4094842.
The product of its (nonzero) digits is 4410, while the sum is 31.
The spelling of 107160300517 in words is "one hundred seven billion, one hundred sixty million, three hundred thousand, five hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •