Base | Representation |
---|---|
bin | 1100110010000… |
… | …10010111000101 |
3 | 21110202200012021 |
4 | 12121002113011 |
5 | 204422222230 |
6 | 14350123141 |
7 | 2441260615 |
oct | 631022705 |
9 | 243680167 |
10 | 107226565 |
11 | 555879a6 |
12 | 2bab04b1 |
13 | 192a3b94 |
14 | 10352a45 |
15 | 9630c7a |
hex | 66425c5 |
107226565 has 8 divisors (see below), whose sum is σ = 136240920. Its totient is φ = 80735232.
The previous prime is 107226547. The next prime is 107226569. The reversal of 107226565 is 565622701.
It can be written as a sum of positive squares in 4 ways, for example, as 10381284 + 96845281 = 3222^2 + 9841^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 107226565 - 213 = 107218373 is a prime.
It is a super-2 number, since 2×1072265652 = 22995072483398450, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 107226565.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107226569) 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, 630660 + ... + 630829.
It is an arithmetic number, because the mean of its divisors is an integer number (17030115).
Almost surely, 2107226565 is an apocalyptic number.
It is an amenable number.
107226565 is a deficient number, since it is larger than the sum of its proper divisors (29014355).
107226565 is a wasteful number, since it uses less digits than its factorization.
107226565 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1261511.
The product of its (nonzero) digits is 25200, while the sum is 34.
The square root of 107226565 is about 10355.0260743274. The cubic root of 107226565 is about 475.0807840441.
The spelling of 107226565 in words is "one hundred seven million, two hundred twenty-six thousand, five hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •