Base | Representation |
---|---|
bin | 1100110001100… |
… | …01101110101000 |
3 | 21110122012202010 |
4 | 12120301232220 |
5 | 204413032230 |
6 | 14344435520 |
7 | 2440555164 |
oct | 630615650 |
9 | 243565663 |
10 | 107158440 |
11 | 555407a4 |
12 | 2ba78ba0 |
13 | 1927bb7c |
14 | 10335ca4 |
15 | 961a9b0 |
hex | 6631ba8 |
107158440 has 32 divisors (see below), whose sum is σ = 321475680. Its totient is φ = 28575552.
The previous prime is 107158433. The next prime is 107158453. The reversal of 107158440 is 44851701.
It is a super-2 number, since 2×1071584402 = 22965862526467200, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 107158398 and 107158407.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 446374 + ... + 446613.
It is an arithmetic number, because the mean of its divisors is an integer number (10046115).
Almost surely, 2107158440 is an apocalyptic number.
107158440 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
107158440 is an abundant number, since it is smaller than the sum of its proper divisors (214317240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107158440 is a wasteful number, since it uses less digits than its factorization.
107158440 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 893001 (or 892997 counting only the distinct ones).
The product of its (nonzero) digits is 4480, while the sum is 30.
The square root of 107158440 is about 10351.7360862804. The cubic root of 107158440 is about 474.9801506018.
The spelling of 107158440 in words is "one hundred seven million, one hundred fifty-eight thousand, four hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •