Base | Representation |
---|---|
bin | 110001111101111001… |
… | …1001100101100101101 |
3 | 101020222011212122100211 |
4 | 1203323303030230231 |
5 | 3224224222431202 |
6 | 121143351022421 |
7 | 10516041360022 |
oct | 1437363145455 |
9 | 336864778324 |
10 | 107303717677 |
11 | 41564173312 |
12 | 1896796aa11 |
13 | a170a15690 |
14 | 529d07b549 |
15 | 2bd05491d7 |
hex | 18fbcccb2d |
107303717677 has 8 divisors (see below), whose sum is σ = 115564869560. Its totient is φ = 99043568640.
The previous prime is 107303717659. The next prime is 107303717699. The reversal of 107303717677 is 776717303701.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 42166979716 + 65136737961 = 205346^2 + 255219^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-107303717677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 107303717677.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107303717617) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 20652 + ... + 463717.
It is an arithmetic number, because the mean of its divisors is an integer number (14445608695).
Almost surely, 2107303717677 is an apocalyptic number.
It is an amenable number.
107303717677 is a deficient number, since it is larger than the sum of its proper divisors (8261151883).
107303717677 is a wasteful number, since it uses less digits than its factorization.
107303717677 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 501423.
The product of its (nonzero) digits is 907578, while the sum is 49.
The spelling of 107303717677 in words is "one hundred seven billion, three hundred three million, seven hundred seventeen thousand, six hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •