Base | Representation |
---|---|
bin | 1000000111100… |
… | …11101101111111 |
3 | 11202011012102111 |
4 | 10003303231333 |
5 | 114413412020 |
6 | 10431434451 |
7 | 1454621035 |
oct | 403635577 |
9 | 152135374 |
10 | 68107135 |
11 | 35498998 |
12 | 1a985a27 |
13 | 111580a5 |
14 | 908c555 |
15 | 5ea4d5a |
hex | 40f3b7f |
68107135 has 4 divisors (see below), whose sum is σ = 81728568. Its totient is φ = 54485704.
The previous prime is 68107129. The next prime is 68107139. The reversal of 68107135 is 53170186.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 68107135 - 25 = 68107103 is a prime.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 68107097 and 68107106.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (68107139) 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 3 ways as a sum of consecutive naturals, for example, 6810709 + ... + 6810718.
It is an arithmetic number, because the mean of its divisors is an integer number (20432142).
Almost surely, 268107135 is an apocalyptic number.
68107135 is a deficient number, since it is larger than the sum of its proper divisors (13621433).
68107135 is a wasteful number, since it uses less digits than its factorization.
68107135 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13621432.
The product of its (nonzero) digits is 5040, while the sum is 31.
The square root of 68107135 is about 8252.7047081548. The cubic root of 68107135 is about 408.3797546373.
The spelling of 68107135 in words is "sixty-eight million, one hundred seven thousand, one hundred thirty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •