Base | Representation |
---|---|
bin | 1010000101110… |
… | …1010101001101 |
3 | 2221122100102122 |
4 | 2201131111031 |
5 | 41313402300 |
6 | 4111102325 |
7 | 1022521310 |
oct | 241352515 |
9 | 87570378 |
10 | 42325325 |
11 | 21989709 |
12 | 122119a5 |
13 | 89cc093 |
14 | 589a977 |
15 | 3ab0c85 |
hex | 285d54d |
42325325 has 48 divisors (see below), whose sum is σ = 65245824. Its totient is φ = 26572800.
The previous prime is 42325321. The next prime is 42325337. The reversal of 42325325 is 52352324.
42325325 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 42325325 - 22 = 42325321 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 42325294 and 42325303.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (42325321) 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 47 ways as a sum of consecutive naturals, for example, 121802 + ... + 122148.
It is an arithmetic number, because the mean of its divisors is an integer number (1359288).
Almost surely, 242325325 is an apocalyptic number.
It is an amenable number.
42325325 is a deficient number, since it is larger than the sum of its proper divisors (22920499).
42325325 is a wasteful number, since it uses less digits than its factorization.
42325325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 422 (or 417 counting only the distinct ones).
The product of its digits is 7200, while the sum is 26.
The square root of 42325325 is about 6505.7916505219. The cubic root of 42325325 is about 348.4978479064.
Adding to 42325325 its reverse (52352324), we get a palindrome (94677649).
The spelling of 42325325 in words is "forty-two million, three hundred twenty-five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •