Base | Representation |
---|---|
bin | 1010000101110… |
… | …0011001110101 |
3 | 2221122011012220 |
4 | 2201130121311 |
5 | 41313242100 |
6 | 4111032553 |
7 | 1022504241 |
oct | 241343165 |
9 | 87564186 |
10 | 42321525 |
11 | 21986874 |
12 | 1220b759 |
13 | 89ca42c |
14 | 5899421 |
15 | 3aaeaa0 |
hex | 285c675 |
42321525 has 48 divisors (see below), whose sum is σ = 73054848. Its totient is φ = 21600000.
The previous prime is 42321511. The next prime is 42321557. The reversal of 42321525 is 52512324.
42321525 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 42321525 - 27 = 42321397 is a prime.
It is a super-2 number, since 2×423215252 = 3582222956651250, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 42321495 and 42321504.
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 47 ways as a sum of consecutive naturals, for example, 280200 + ... + 280350.
It is an arithmetic number, because the mean of its divisors is an integer number (1521976).
Almost surely, 242321525 is an apocalyptic number.
It is an amenable number.
42321525 is a deficient number, since it is larger than the sum of its proper divisors (30733323).
42321525 is a wasteful number, since it uses less digits than its factorization.
42321525 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 302 (or 297 counting only the distinct ones).
The product of its digits is 2400, while the sum is 24.
The square root of 42321525 is about 6505.4995964953. The cubic root of 42321525 is about 348.4874181266.
Adding to 42321525 its reverse (52512324), we get a palindrome (94833849).
The spelling of 42321525 in words is "forty-two million, three hundred twenty-one thousand, five hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •