Base | Representation |
---|---|
bin | 1010000101111… |
… | …0101000000000 |
3 | 2221122121200220 |
4 | 2201132220000 |
5 | 41314034444 |
6 | 4111143040 |
7 | 1022542620 |
oct | 241365000 |
9 | 87577626 |
10 | 42330624 |
11 | 21992696 |
12 | 12214a80 |
13 | 8a0160b |
14 | 589c880 |
15 | 3ab2619 |
hex | 285ea00 |
42330624 has 160 divisors (see below), whose sum is σ = 134086656. Its totient is φ = 11612160.
The previous prime is 42330571. The next prime is 42330677. The reversal of 42330624 is 42603324.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (42330571) and next prime (42330677).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a junction number, because it is equal to n+sod(n) for n = 42330594 and 42330603.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 333249 + ... + 333375.
Almost surely, 242330624 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 42330624, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (67043328).
42330624 is an abundant number, since it is smaller than the sum of its proper divisors (91756032).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42330624 is a wasteful number, since it uses less digits than its factorization.
42330624 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186 (or 170 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
The square root of 42330624 is about 6506.1988902892. The cubic root of 42330624 is about 348.5123909176.
Adding to 42330624 its reverse (42603324), we get a palindrome (84933948).
The spelling of 42330624 in words is "forty-two million, three hundred thirty thousand, six hundred twenty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •