Base | Representation |
---|---|
bin | 110001111110001101… |
… | …1011000001110110101 |
3 | 101020222220200202220221 |
4 | 1203330123120032311 |
5 | 3224234422010202 |
6 | 121144404454341 |
7 | 10516230036334 |
oct | 1437433301665 |
9 | 336886622827 |
10 | 107314250677 |
11 | 4156a107977 |
12 | 1896b3aa3b1 |
13 | a172c62a1a |
14 | 52a061dd1b |
15 | 2bd142a037 |
hex | 18fc6d83b5 |
107314250677 has 4 divisors (see below), whose sum is σ = 113626853676. Its totient is φ = 101001647680.
The previous prime is 107314250669. The next prime is 107314250741. The reversal of 107314250677 is 776052413701.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 98881318116 + 8432932561 = 314454^2 + 91831^2 .
It is a cyclic number.
It is not a de Polignac number, because 107314250677 - 23 = 107314250669 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107314250377) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3156301474 + ... + 3156301507.
It is an arithmetic number, because the mean of its divisors is an integer number (28406713419).
Almost surely, 2107314250677 is an apocalyptic number.
107314250677 is a gapful number since it is divisible by the number (17) formed by its first and last digit.
It is an amenable number.
107314250677 is a deficient number, since it is larger than the sum of its proper divisors (6312602999).
107314250677 is an equidigital number, since it uses as much as digits as its factorization.
107314250677 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6312602998.
The product of its (nonzero) digits is 246960, while the sum is 43.
The spelling of 107314250677 in words is "one hundred seven billion, three hundred fourteen million, two hundred fifty thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •