Base | Representation |
---|---|
bin | 1100110000011… |
… | …10110110111001 |
3 | 21110100221211002 |
4 | 12120032312321 |
5 | 204343444414 |
6 | 14341414345 |
7 | 2436421601 |
oct | 630166671 |
9 | 243327732 |
10 | 107015609 |
11 | 55453458 |
12 | 2ba0a3b5 |
13 | 1922bb5c |
14 | 102d9c01 |
15 | 95dd4de |
hex | 660edb9 |
107015609 has 2 divisors, whose sum is σ = 107015610. Its totient is φ = 107015608.
The previous prime is 107015567. The next prime is 107015651. The reversal of 107015609 is 906510701.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (107015567) and next prime (107015651).
It can be written as a sum of positive squares in only one way, i.e., 99940009 + 7075600 = 9997^2 + 2660^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-107015609 is a prime.
It is a super-2 number, since 2×1070156092 = 22904681139281762, which contains 22 as substring.
It is a Chen prime.
It is equal to p6141692 and since 107015609 and 6141692 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (107015659) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 53507804 + 53507805.
It is an arithmetic number, because the mean of its divisors is an integer number (53507805).
Almost surely, 2107015609 is an apocalyptic number.
It is an amenable number.
107015609 is a deficient number, since it is larger than the sum of its proper divisors (1).
107015609 is an equidigital number, since it uses as much as digits as its factorization.
107015609 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 29.
The square root of 107015609 is about 10344.8348947675. The cubic root of 107015609 is about 474.7690238058.
The spelling of 107015609 in words is "one hundred seven million, fifteen thousand, six hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •