Base | Representation |
---|---|
bin | 1010000011010… |
… | …0010001000000 |
3 | 2221022210200211 |
4 | 2200310101000 |
5 | 41243011440 |
6 | 4103323504 |
7 | 1021221025 |
oct | 240642100 |
9 | 87283624 |
10 | 42157120 |
11 | 218842a5 |
12 | 12150594 |
13 | 8970655 |
14 | 585554c |
15 | 3a7aeea |
hex | 2834440 |
42157120 has 56 divisors (see below), whose sum is σ = 102559104. Its totient is φ = 16498176.
The previous prime is 42157109. The next prime is 42157123. The reversal of 42157120 is 2175124.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 42157091 and 42157100.
It is not an unprimeable number, because it can be changed into a prime (42157123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 13639 + ... + 16441.
Almost surely, 242157120 is an apocalyptic number.
42157120 is a gapful number since it is divisible by the number (40) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42157120, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (51279552).
42157120 is an abundant number, since it is smaller than the sum of its proper divisors (60401984).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42157120 is a wasteful number, since it uses less digits than its factorization.
42157120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2867 (or 2857 counting only the distinct ones).
The product of its (nonzero) digits is 560, while the sum is 22.
The square root of 42157120 is about 6492.8514537143. The cubic root of 42157120 is about 348.0355801028.
The spelling of 42157120 in words is "forty-two million, one hundred fifty-seven thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •