Base | Representation |
---|---|
bin | 1001110011001… |
… | …0100000001101 |
3 | 2212100011102022 |
4 | 2130302200031 |
5 | 41010220300 |
6 | 4024535525 |
7 | 1006232636 |
oct | 234624015 |
9 | 85304368 |
10 | 41101325 |
11 | 21223041 |
12 | 119215a5 |
13 | 8690c15 |
14 | 565c88d |
15 | 391d285 |
hex | 273280d |
41101325 has 24 divisors (see below), whose sum is σ = 54574632. Its totient is φ = 30597120.
The previous prime is 41101321. The next prime is 41101331. The reversal of 41101325 is 52310114.
It can be written as a sum of positive squares in 12 ways, for example, as 1800964 + 39300361 = 1342^2 + 6269^2 .
It is not a de Polignac number, because 41101325 - 22 = 41101321 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (17).
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41101321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 40727 + ... + 41723.
It is an arithmetic number, because the mean of its divisors is an integer number (2273943).
Almost surely, 241101325 is an apocalyptic number.
It is an amenable number.
41101325 is a deficient number, since it is larger than the sum of its proper divisors (13473307).
41101325 is a wasteful number, since it uses less digits than its factorization.
41101325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1121 (or 1116 counting only the distinct ones).
The product of its (nonzero) digits is 120, while the sum is 17.
The square root of 41101325 is about 6411.0315082676. The cubic root of 41101325 is about 345.1055477661.
Adding to 41101325 its reverse (52310114), we get a palindrome (93411439).
The spelling of 41101325 in words is "forty-one million, one hundred one thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •