Base | Representation |
---|---|
bin | 1010001110100… |
… | …1111110100000 |
3 | 2222201121200001 |
4 | 2203221332200 |
5 | 41440321113 |
6 | 4131305344 |
7 | 1030440664 |
oct | 243517640 |
9 | 88647601 |
10 | 42901408 |
11 | 22242510 |
12 | 1244b254 |
13 | 8b71364 |
14 | 59aa8a4 |
15 | 3b767dd |
hex | 28e9fa0 |
42901408 has 48 divisors (see below), whose sum is σ = 92673504. Its totient is φ = 19388160.
The previous prime is 42901403. The next prime is 42901423. The reversal of 42901408 is 80410924.
42901408 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not an unprimeable number, because it can be changed into a prime (42901403) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 107866 + ... + 108262.
It is an arithmetic number, because the mean of its divisors is an integer number (1930698).
Almost surely, 242901408 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 42901408, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46336752).
42901408 is an abundant number, since it is smaller than the sum of its proper divisors (49772096).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
42901408 is a wasteful number, since it uses less digits than its factorization.
42901408 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 725 (or 717 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 28.
The square root of 42901408 is about 6549.9166406909. The cubic root of 42901408 is about 350.0718437552.
The spelling of 42901408 in words is "forty-two million, nine hundred one thousand, four hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •