Base | Representation |
---|---|
bin | 1100101110100… |
… | …00010010101101 |
3 | 21102212221021200 |
4 | 12113100102231 |
5 | 204312244331 |
6 | 14332120113 |
7 | 2434303503 |
oct | 627202255 |
9 | 242787250 |
10 | 106759341 |
11 | 55298967 |
12 | 2b906039 |
13 | 1916c310 |
14 | 10270673 |
15 | 958c5e6 |
hex | 65d04ad |
106759341 has 24 divisors (see below), whose sum is σ = 168561120. Its totient is φ = 64712736.
The previous prime is 106759297. The next prime is 106759351. The reversal of 106759341 is 143957601.
106759341 is a `hidden beast` number, since 1 + 0 + 67 + 593 + 4 + 1 = 666.
It is not a de Polignac number, because 106759341 - 211 = 106757293 is a prime.
It is a super-2 number, since 2×1067593412 = 22795113781508562, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 106759296 and 106759305.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (106759351) 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 in 23 ways as a sum of consecutive naturals, for example, 1030 + ... + 14648.
It is an arithmetic number, because the mean of its divisors is an integer number (7023380).
Almost surely, 2106759341 is an apocalyptic number.
It is an amenable number.
106759341 is a deficient number, since it is larger than the sum of its proper divisors (61801779).
106759341 is a wasteful number, since it uses less digits than its factorization.
106759341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13705 (or 13702 counting only the distinct ones).
The product of its (nonzero) digits is 22680, while the sum is 36.
The square root of 106759341 is about 10332.4411926708. The cubic root of 106759341 is about 474.3897478061.
The spelling of 106759341 in words is "one hundred six million, seven hundred fifty-nine thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •