Base | Representation |
---|---|
bin | 1010001011101… |
… | …0110001011100 |
3 | 2222100210110000 |
4 | 2202322301130 |
5 | 41413124220 |
6 | 4123214300 |
7 | 1026004203 |
oct | 242726134 |
9 | 88323400 |
10 | 42708060 |
11 | 2212021a |
12 | 12377390 |
13 | 8b04355 |
14 | 595a23a |
15 | 3b39390 |
hex | 28bac5c |
42708060 has 120 divisors (see below), whose sum is σ = 137457936. Its totient is φ = 11093760.
The previous prime is 42708059. The next prime is 42708077. The reversal of 42708060 is 6080724.
42708060 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
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 39 ways as a sum of consecutive naturals, for example, 66099 + ... + 66741.
Almost surely, 242708060 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 42708060, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (68728968).
42708060 is an abundant number, since it is smaller than the sum of its proper divisors (94749876).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42708060 is a wasteful number, since it uses less digits than its factorization.
42708060 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 705 (or 694 counting only the distinct ones).
The product of its (nonzero) digits is 2688, while the sum is 27.
The square root of 42708060 is about 6535.1403963496. The cubic root of 42708060 is about 349.5451506443.
Adding to 42708060 its reverse (6080724), we get a palindrome (48788784).
The spelling of 42708060 in words is "forty-two million, seven hundred eight thousand, sixty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •