Base | Representation |
---|---|
bin | 1001110101100… |
… | …0001001110101 |
3 | 2212121222222000 |
4 | 2131120021311 |
5 | 41030134131 |
6 | 4032125513 |
7 | 1010444355 |
oct | 235301165 |
9 | 85558860 |
10 | 41255541 |
11 | 21318998 |
12 | 11996899 |
13 | 8716182 |
14 | 569cb65 |
15 | 394dce6 |
hex | 2758275 |
41255541 has 8 divisors (see below), whose sum is σ = 61119360. Its totient is φ = 27503676.
The previous prime is 41255503. The next prime is 41255597. The reversal of 41255541 is 14555214.
41255541 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 41255541 - 26 = 41255477 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 1527983 = 41255541 / (4 + 1 + 2 + 5 + 5 + 5 + 4 + 1).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41250541) 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 7 ways as a sum of consecutive naturals, for example, 763965 + ... + 764018.
It is an arithmetic number, because the mean of its divisors is an integer number (7639920).
Almost surely, 241255541 is an apocalyptic number.
It is an amenable number.
41255541 is a deficient number, since it is larger than the sum of its proper divisors (19863819).
41255541 is a wasteful number, since it uses less digits than its factorization.
41255541 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1527992 (or 1527986 counting only the distinct ones).
The product of its digits is 4000, while the sum is 27.
The square root of 41255541 is about 6423.0476411124. The cubic root of 41255541 is about 345.5366317797.
The spelling of 41255541 in words is "forty-one million, two hundred fifty-five thousand, five hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.124 sec. • engine limits •