Base | Representation |
---|---|
bin | 1001111001100… |
… | …0111110000001 |
3 | 2220010111010202 |
4 | 2132120332001 |
5 | 41112133100 |
6 | 4041534545 |
7 | 1012631360 |
oct | 236307601 |
9 | 86114122 |
10 | 41521025 |
11 | 2148a3a7 |
12 | 11aa4455 |
13 | 87a9c70 |
14 | 572b7d7 |
15 | 39a27d5 |
hex | 2798f81 |
41521025 has 24 divisors (see below), whose sum is σ = 63370944. Its totient is φ = 26280000.
The previous prime is 41521009. The next prime is 41521027. The reversal of 41521025 is 52012514.
41521025 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 41521025 - 24 = 41521009 is a prime.
It is a zygodrome in base 12.
It is a junction number, because it is equal to n+sod(n) for n = 41520988 and 41521006.
It is not an unprimeable number, because it can be changed into a prime (41521027) 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 23 ways as a sum of consecutive naturals, for example, 6851 + ... + 11400.
It is an arithmetic number, because the mean of its divisors is an integer number (2640456).
Almost surely, 241521025 is an apocalyptic number.
It is an amenable number.
41521025 is a deficient number, since it is larger than the sum of its proper divisors (21849919).
41521025 is a wasteful number, since it uses less digits than its factorization.
41521025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18281 (or 18276 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 20.
The square root of 41521025 is about 6443.6810132098. The cubic root of 41521025 is about 346.2762364615.
Adding to 41521025 its reverse (52012514), we get a palindrome (93533539).
The spelling of 41521025 in words is "forty-one million, five hundred twenty-one thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •