Base | Representation |
---|---|
bin | 1001110100101… |
… | …1110100100001 |
3 | 2212112102200001 |
4 | 2131023310201 |
5 | 41022030100 |
6 | 4031100001 |
7 | 1010144161 |
oct | 235136441 |
9 | 85472601 |
10 | 41205025 |
11 | 21293a44 |
12 | 11971601 |
13 | 86c9194 |
14 | 56885a1 |
15 | 393dd6a |
hex | 274bd21 |
41205025 has 12 divisors (see below), whose sum is σ = 54100332. Its totient is φ = 31024640.
The previous prime is 41205011. The next prime is 41205037. The reversal of 41205025 is 52050214.
41205025 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 6 ways, for example, as 2155024 + 39050001 = 1468^2 + 6249^2 .
It is not a de Polignac number, because 41205025 - 25 = 41204993 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 41204993 and 41205011.
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 11 ways as a sum of consecutive naturals, for example, 48052 + ... + 48901.
It is an arithmetic number, because the mean of its divisors is an integer number (4508361).
Almost surely, 241205025 is an apocalyptic number.
It is an amenable number.
41205025 is a deficient number, since it is larger than the sum of its proper divisors (12895307).
41205025 is a wasteful number, since it uses less digits than its factorization.
41205025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96980 (or 96975 counting only the distinct ones).
The product of its (nonzero) digits is 400, while the sum is 19.
The square root of 41205025 is about 6419.1140354413. The cubic root of 41205025 is about 345.3955415784.
Adding to 41205025 its reverse (52050214), we get a palindrome (93255239).
The spelling of 41205025 in words is "forty-one million, two hundred five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •