Base | Representation |
---|---|
bin | 100000010010001… |
… | …011001000110101 |
3 | 1101202011220201012 |
4 | 200102023020311 |
5 | 2102124311000 |
6 | 125425042005 |
7 | 16264552103 |
oct | 4022131065 |
9 | 1352156635 |
10 | 541635125 |
11 | 258814539 |
12 | 131486305 |
13 | 882a1c75 |
14 | 51d12c73 |
15 | 3283e735 |
hex | 2048b235 |
541635125 has 8 divisors (see below), whose sum is σ = 675960792. Its totient is φ = 433308000.
The previous prime is 541635121. The next prime is 541635137. The reversal of 541635125 is 521536145.
It can be written as a sum of positive squares in 4 ways, for example, as 26481316 + 515153809 = 5146^2 + 22697^2 .
It is not a de Polignac number, because 541635125 - 22 = 541635121 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 541635091 and 541635100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (541635121) 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 7 ways as a sum of consecutive naturals, for example, 2166416 + ... + 2166665.
It is an arithmetic number, because the mean of its divisors is an integer number (84495099).
Almost surely, 2541635125 is an apocalyptic number.
It is an amenable number.
541635125 is a deficient number, since it is larger than the sum of its proper divisors (134325667).
541635125 is an equidigital number, since it uses as much as digits as its factorization.
541635125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4333096 (or 4333086 counting only the distinct ones).
The product of its digits is 18000, while the sum is 32.
The square root of 541635125 is about 23273.0557727171. The cubic root of 541635125 is about 815.1463849369.
The spelling of 541635125 in words is "five hundred forty-one million, six hundred thirty-five thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •