Base | Representation |
---|---|
bin | 1100101101111… |
… | …01101101100101 |
3 | 21102202001220000 |
4 | 12112331231211 |
5 | 204302330422 |
6 | 14330331513 |
7 | 2433535563 |
oct | 626755545 |
9 | 242661800 |
10 | 106683237 |
11 | 55246771 |
12 | 2b889b99 |
13 | 1914379b |
14 | 10250a33 |
15 | 9574cac |
hex | 65bdb65 |
106683237 has 20 divisors (see below), whose sum is σ = 159767916. Its totient is φ = 70943040.
The previous prime is 106683221. The next prime is 106683277. The reversal of 106683237 is 732386601.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 53012961 + 53670276 = 7281^2 + 7326^2 .
It is not a de Polignac number, because 106683237 - 24 = 106683221 is a prime.
It is a super-2 number, since 2×1066832372 = 22762626113596338, which contains 22 as substring.
It is a hoax number, since the sum of its digits (36) coincides with the sum of the digits of its distinct prime factors.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106683217) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 35913 + ... + 38769.
Almost surely, 2106683237 is an apocalyptic number.
It is an amenable number.
106683237 is a deficient number, since it is larger than the sum of its proper divisors (53084679).
106683237 is an equidigital number, since it uses as much as digits as its factorization.
106683237 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3330 (or 3321 counting only the distinct ones).
The product of its (nonzero) digits is 36288, while the sum is 36.
The square root of 106683237 is about 10328.7577665468. The cubic root of 106683237 is about 474.2769972053.
The spelling of 106683237 in words is "one hundred six million, six hundred eighty-three thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •