Base | Representation |
---|---|
bin | 1100110001111… |
… | …01000010011001 |
3 | 21110201120021201 |
4 | 12120331002121 |
5 | 204421023021 |
6 | 14345434201 |
7 | 2441140216 |
oct | 630750231 |
9 | 243646251 |
10 | 107204761 |
11 | 55572584 |
12 | 2ba9b961 |
13 | 19296c91 |
14 | 10348b0d |
15 | 9629591 |
hex | 663d099 |
107204761 has 2 divisors, whose sum is σ = 107204762. Its totient is φ = 107204760.
The previous prime is 107204759. The next prime is 107204809. The reversal of 107204761 is 167402701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 95942025 + 11262736 = 9795^2 + 3356^2 .
It is an emirp because it is prime and its reverse (167402701) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 107204761 - 21 = 107204759 is a prime.
It is a super-2 number, since 2×1072047612 = 22985721562134242, which contains 22 as substring.
Together with 107204759, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (107204731) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53602380 + 53602381.
It is an arithmetic number, because the mean of its divisors is an integer number (53602381).
Almost surely, 2107204761 is an apocalyptic number.
It is an amenable number.
107204761 is a deficient number, since it is larger than the sum of its proper divisors (1).
107204761 is an equidigital number, since it uses as much as digits as its factorization.
107204761 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2352, while the sum is 28.
The square root of 107204761 is about 10353.9731987291. The cubic root of 107204761 is about 475.0485800729.
The spelling of 107204761 in words is "one hundred seven million, two hundred four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •