Base | Representation |
---|---|
bin | 1010000001101… |
… | …1101110110001 |
3 | 2221010200211210 |
4 | 2200123232301 |
5 | 41231303000 |
6 | 4101230333 |
7 | 1020322032 |
oct | 240335661 |
9 | 87120753 |
10 | 42056625 |
11 | 21815846 |
12 | 121023a9 |
13 | 89369a0 |
14 | 582aa89 |
15 | 3a5b350 |
hex | 281bbb1 |
42056625 has 32 divisors (see below), whose sum is σ = 75374208. Its totient is φ = 20702400.
The previous prime is 42056621. The next prime is 42056629. The reversal of 42056625 is 52665024.
42056625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an interprime number because it is at equal distance from previous prime (42056621) and next prime (42056629).
It is not a de Polignac number, because 42056625 - 22 = 42056621 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42056592 and 42056601.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42056621) 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 31 ways as a sum of consecutive naturals, for example, 562 + ... + 9188.
It is an arithmetic number, because the mean of its divisors is an integer number (2355444).
Almost surely, 242056625 is an apocalyptic number.
It is an amenable number.
42056625 is a deficient number, since it is larger than the sum of its proper divisors (33317583).
42056625 is a wasteful number, since it uses less digits than its factorization.
42056625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8658 (or 8648 counting only the distinct ones).
The product of its (nonzero) digits is 14400, while the sum is 30.
The square root of 42056625 is about 6485.1079405049. The cubic root of 42056625 is about 347.7588086304.
The spelling of 42056625 in words is "forty-two million, fifty-six thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •