Base | Representation |
---|---|
bin | 1100110001011… |
… | …00001111000000 |
3 | 21110121001212122 |
4 | 12120230033000 |
5 | 204411322221 |
6 | 14344143412 |
7 | 2440432445 |
oct | 630541700 |
9 | 243531778 |
10 | 107135936 |
11 | 555258a6 |
12 | 2ba67b68 |
13 | 1927185b |
14 | 1032b9cc |
15 | 9613eab |
hex | 662c3c0 |
107135936 has 28 divisors (see below), whose sum is σ = 217127328. Its totient is φ = 52426752.
The previous prime is 107135923. The next prime is 107135953. The reversal of 107135936 is 639531701.
It is a super-2 number, since 2×1071359362 = 22956217565192192, which contains 22 as substring.
It is a hoax number, since the sum of its digits (35) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 107135896 and 107135905.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 14801 + ... + 20816.
Almost surely, 2107135936 is an apocalyptic number.
107135936 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
107135936 is an abundant number, since it is smaller than the sum of its proper divisors (109991392).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107135936 is an equidigital number, since it uses as much as digits as its factorization.
107135936 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 35676 (or 35666 counting only the distinct ones).
The product of its (nonzero) digits is 17010, while the sum is 35.
The square root of 107135936 is about 10350.6490617739. The cubic root of 107135936 is about 474.9468985884.
The spelling of 107135936 in words is "one hundred seven million, one hundred thirty-five thousand, nine hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •