Base | Representation |
---|---|
bin | 1100101100100… |
… | …11100010011001 |
3 | 21102102021220221 |
4 | 12112103202121 |
5 | 204231313424 |
6 | 14322520041 |
7 | 2432216131 |
oct | 626234231 |
9 | 242367827 |
10 | 106510489 |
11 | 551389a8 |
12 | 2b806021 |
13 | 190b2c77 |
14 | 10207ac1 |
15 | 953d9e4 |
hex | 6593899 |
106510489 has 2 divisors, whose sum is σ = 106510490. Its totient is φ = 106510488.
The previous prime is 106510477. The next prime is 106510501. The reversal of 106510489 is 984015601.
It is a balanced prime because it is at equal distance from previous prime (106510477) and next prime (106510501).
It can be written as a sum of positive squares in only one way, i.e., 105925264 + 585225 = 10292^2 + 765^2 .
It is a cyclic number.
It is not a de Polignac number, because 106510489 - 27 = 106510361 is a prime.
It is a super-2 number, since 2×1065104892 = 22688968534038242, which contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (106510189) 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, 53255244 + 53255245.
It is an arithmetic number, because the mean of its divisors is an integer number (53255245).
Almost surely, 2106510489 is an apocalyptic number.
It is an amenable number.
106510489 is a deficient number, since it is larger than the sum of its proper divisors (1).
106510489 is an equidigital number, since it uses as much as digits as its factorization.
106510489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8640, while the sum is 34.
The square root of 106510489 is about 10320.3919014735. The cubic root of 106510489 is about 474.0208661671.
The spelling of 106510489 in words is "one hundred six million, five hundred ten thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •