Base | Representation |
---|---|
bin | 1010000110110… |
… | …0100011110110 |
3 | 2221202111222220 |
4 | 2201230203312 |
5 | 41322401302 |
6 | 4112303210 |
7 | 1023201210 |
oct | 241544366 |
9 | 87674886 |
10 | 42387702 |
11 | 21a21565 |
12 | 12241b06 |
13 | 8a215a6 |
14 | 58b55b0 |
15 | 3ac44bc |
hex | 286c8f6 |
42387702 has 64 divisors (see below), whose sum is σ = 100362240. Its totient is φ = 11684736.
The previous prime is 42387679. The next prime is 42387713. The reversal of 42387702 is 20778324.
42387702 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 31 ways as a sum of consecutive naturals, for example, 215068 + ... + 215264.
It is an arithmetic number, because the mean of its divisors is an integer number (1568160).
Almost surely, 242387702 is an apocalyptic number.
42387702 is a gapful number since it is divisible by the number (42) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 42387702, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (50181120).
42387702 is an abundant number, since it is smaller than the sum of its proper divisors (57974538).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42387702 is a wasteful number, since it uses less digits than its factorization.
42387702 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 365.
The product of its (nonzero) digits is 18816, while the sum is 33.
The square root of 42387702 is about 6510.5838447869. The cubic root of 42387702 is about 348.6689635845.
The spelling of 42387702 in words is "forty-two million, three hundred eighty-seven thousand, seven hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •