Base | Representation |
---|---|
bin | 1100110000011… |
… | …10111000111110 |
3 | 21110100222000000 |
4 | 12120032320332 |
5 | 204344000432 |
6 | 14341415130 |
7 | 2436422151 |
oct | 630167076 |
9 | 243328000 |
10 | 107015742 |
11 | 55453569 |
12 | 2ba0a4a6 |
13 | 1922bc32 |
14 | 102d9c98 |
15 | 95dd57c |
hex | 660ee3e |
107015742 has 56 divisors (see below), whose sum is σ = 249072840. Its totient is φ = 34428240.
The previous prime is 107015681. The next prime is 107015743. The reversal of 107015742 is 247510701.
It is a super-2 number, since 2×1070157422 = 22904738071621128, which contains 22 as substring.
It is a hoax number, since the sum of its digits (27) coincides with the sum of the digits of its distinct prime factors.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (107015743) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 41017 + ... + 43547.
Almost surely, 2107015742 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 107015742, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (124536420).
107015742 is an abundant number, since it is smaller than the sum of its proper divisors (142057098).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
107015742 is an equidigital number, since it uses as much as digits as its factorization.
107015742 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2580 (or 2565 counting only the distinct ones).
The product of its (nonzero) digits is 1960, while the sum is 27.
The square root of 107015742 is about 10344.8413230943. The cubic root of 107015742 is about 474.7692204882.
The spelling of 107015742 in words is "one hundred seven million, fifteen thousand, seven hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •