Base | Representation |
---|---|
bin | 1100110000111… |
… | …01110010000101 |
3 | 21110111001200020 |
4 | 12120131302011 |
5 | 204402423431 |
6 | 14343005353 |
7 | 2440065042 |
oct | 630356205 |
9 | 243431606 |
10 | 107076741 |
11 | 55495382 |
12 | 2ba39859 |
13 | 19250925 |
14 | 103141c9 |
15 | 9601696 |
hex | 661dc85 |
107076741 has 4 divisors (see below), whose sum is σ = 142768992. Its totient is φ = 71384492.
The previous prime is 107076721. The next prime is 107076743. The reversal of 107076741 is 147670701.
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 not a de Polignac number, because 107076741 - 25 = 107076709 is a prime.
It is a super-2 number, since 2×1070767412 = 22930856926362162, which contains 22 as substring.
It is an alternating number because its digits alternate between odd and even.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107076743) 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 in 3 ways as a sum of consecutive naturals, for example, 17846121 + ... + 17846126.
It is an arithmetic number, because the mean of its divisors is an integer number (35692248).
Almost surely, 2107076741 is an apocalyptic number.
It is an amenable number.
107076741 is a deficient number, since it is larger than the sum of its proper divisors (35692251).
107076741 is an equidigital number, since it uses as much as digits as its factorization.
107076741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35692250.
The product of its (nonzero) digits is 8232, while the sum is 33.
The square root of 107076741 is about 10347.7891841688. The cubic root of 107076741 is about 474.8594095464.
The spelling of 107076741 in words is "one hundred seven million, seventy-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •