Base | Representation |
---|---|
bin | 1010000001111… |
… | …0011000011000 |
3 | 2221011020201211 |
4 | 2200132120120 |
5 | 41232124410 |
6 | 4101352504 |
7 | 1020365500 |
oct | 240363030 |
9 | 87136654 |
10 | 42067480 |
11 | 21822a14 |
12 | 12108734 |
13 | 893b900 |
14 | 5830a00 |
15 | 3a5e68a |
hex | 281e618 |
42067480 has 144 divisors (see below), whose sum is σ = 120165120. Its totient is φ = 13208832.
The previous prime is 42067457. The next prime is 42067481. The reversal of 42067480 is 8476024.
It is a super-3 number, since 3×420674803 (a number of 24 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42067481) by changing a digit.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 331177 + ... + 331303.
It is an arithmetic number, because the mean of its divisors is an integer number (834480).
Almost surely, 242067480 is an apocalyptic number.
42067480 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 42067480, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60082560).
42067480 is an abundant number, since it is smaller than the sum of its proper divisors (78097640).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42067480 is a wasteful number, since it uses less digits than its factorization.
42067480 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178 (or 154 counting only the distinct ones).
The product of its (nonzero) digits is 10752, while the sum is 31.
The square root of 42067480 is about 6485.9448039588. The cubic root of 42067480 is about 347.7887254163.
The spelling of 42067480 in words is "forty-two million, sixty-seven thousand, four hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •