Base | Representation |
---|---|
bin | 1010001010111… |
… | …1100111011100 |
3 | 2222021110202120 |
4 | 2202233213130 |
5 | 41410143424 |
6 | 4122222540 |
7 | 1025424033 |
oct | 242574734 |
9 | 88243676 |
10 | 42662364 |
11 | 22099958 |
12 | 12354a50 |
13 | 8ab9604 |
14 | 594771a |
15 | 3b2aa79 |
hex | 28af9dc |
42662364 has 48 divisors (see below), whose sum is σ = 105409920. Its totient is φ = 13406400.
The previous prime is 42662357. The next prime is 42662371. The reversal of 42662364 is 46326624.
It is an interprime number because it is at equal distance from previous prime (42662357) and next prime (42662371).
It is a nude number because it is divisible by every one of its digits.
It is a congruent number.
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, 13539 + ... + 16389.
It is an arithmetic number, because the mean of its divisors is an integer number (2196040).
Almost surely, 242662364 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 42662364, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (52704960).
42662364 is an abundant number, since it is smaller than the sum of its proper divisors (62747556).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42662364 is a wasteful number, since it uses less digits than its factorization.
42662364 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2930 (or 2928 counting only the distinct ones).
The product of its digits is 41472, while the sum is 33.
The square root of 42662364 is about 6531.6432848097. The cubic root of 42662364 is about 349.4204394823.
Adding to 42662364 its reverse (46326624), we get a palindrome (88988988).
The spelling of 42662364 in words is "forty-two million, six hundred sixty-two thousand, three hundred sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •