Base | Representation |
---|---|
bin | 1010000001101… |
… | …1011101001101 |
3 | 2221010122022011 |
4 | 2200123131031 |
5 | 41231234001 |
6 | 4101221221 |
7 | 1020315535 |
oct | 240333515 |
9 | 87118264 |
10 | 42055501 |
11 | 21814a14 |
12 | 12101811 |
13 | 8936317 |
14 | 582a4c5 |
15 | 3a5ad51 |
hex | 281b74d |
42055501 has 8 divisors (see below), whose sum is σ = 45157824. Its totient is φ = 39023040.
The previous prime is 42055487. The next prime is 42055511. The reversal of 42055501 is 10555024.
42055501 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42055501 is a prime.
It is a super-2 number, since 2×420555012 = 3537330328722002, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42055511) 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, 16215 + ... + 18628.
It is an arithmetic number, because the mean of its divisors is an integer number (5644728).
Almost surely, 242055501 is an apocalyptic number.
It is an amenable number.
42055501 is a deficient number, since it is larger than the sum of its proper divisors (3102323).
42055501 is a wasteful number, since it uses less digits than its factorization.
42055501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34931.
The product of its (nonzero) digits is 1000, while the sum is 22.
The square root of 42055501 is about 6485.0212798417. The cubic root of 42055501 is about 347.7557105503.
The spelling of 42055501 in words is "forty-two million, fifty-five thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •