Base | Representation |
---|---|
bin | 1100101100101… |
… | …00000100011111 |
3 | 21102102101220202 |
4 | 12112110010133 |
5 | 204231401141 |
6 | 14322534115 |
7 | 2432225366 |
oct | 626240437 |
9 | 242371822 |
10 | 106512671 |
11 | 5513a601 |
12 | 2b80733b |
13 | 190b3c65 |
14 | 102087dd |
15 | 953e49b |
hex | 659411f |
106512671 has 2 divisors, whose sum is σ = 106512672. Its totient is φ = 106512670.
The previous prime is 106512643. The next prime is 106512673. The reversal of 106512671 is 176215601.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 106512671 - 26 = 106512607 is a prime.
It is a super-2 number, since 2×1065126712 = 22689898167108482, which contains 22 as substring.
It is a Sophie Germain prime.
Together with 106512673, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (106512673) 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, 53256335 + 53256336.
It is an arithmetic number, because the mean of its divisors is an integer number (53256336).
Almost surely, 2106512671 is an apocalyptic number.
106512671 is a deficient number, since it is larger than the sum of its proper divisors (1).
106512671 is an equidigital number, since it uses as much as digits as its factorization.
106512671 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
The square root of 106512671 is about 10320.4976139719. The cubic root of 106512671 is about 474.0241031142.
The spelling of 106512671 in words is "one hundred six million, five hundred twelve thousand, six hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.196 sec. • engine limits •