Base | Representation |
---|---|
bin | 1010001010011… |
… | …0011110010000 |
3 | 2222012120101110 |
4 | 2202212132100 |
5 | 41402444122 |
6 | 4121333320 |
7 | 1025206611 |
oct | 242463620 |
9 | 88176343 |
10 | 42624912 |
11 | 22073800 |
12 | 12337240 |
13 | 8aa5555 |
14 | 5937c08 |
15 | 3b1e90c |
hex | 28a6790 |
42624912 has 120 divisors (see below), whose sum is σ = 124679520. Its totient is φ = 12531200.
The previous prime is 42624893. The next prime is 42624941. The reversal of 42624912 is 21942624.
It is a super-3 number, since 3×426249123 (a number of 24 digits) contains 333 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 42624912.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 238039 + ... + 238217.
It is an arithmetic number, because the mean of its divisors is an integer number (1038996).
Almost surely, 242624912 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 42624912, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (62339760).
42624912 is an abundant number, since it is smaller than the sum of its proper divisors (82054608).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42624912 is a wasteful number, since it uses less digits than its factorization.
42624912 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 253 (or 236 counting only the distinct ones).
The product of its digits is 6912, while the sum is 30.
The square root of 42624912 is about 6528.7756892085. The cubic root of 42624912 is about 349.3181609996.
The spelling of 42624912 in words is "forty-two million, six hundred twenty-four thousand, nine hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •