Base | Representation |
---|---|
bin | 1010000000001… |
… | …1010110000000 |
3 | 2220221121211012 |
4 | 2200003112000 |
5 | 41220103421 |
6 | 4055140052 |
7 | 1016424563 |
oct | 240032600 |
9 | 86847735 |
10 | 41956736 |
11 | 21757798 |
12 | 12074628 |
13 | 8900393 |
14 | 58024da |
15 | 3a3b95b |
hex | 2803580 |
41956736 has 64 divisors (see below), whose sum is σ = 88128000. Its totient is φ = 19869696.
The previous prime is 41956727. The next prime is 41956753. The reversal of 41956736 is 63765914.
It is a tau number, because it is divible by the number of its divisors (64).
It is a junction number, because it is equal to n+sod(n) for n = 41956693 and 41956702.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (7) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 330305 + ... + 330431.
It is an arithmetic number, because the mean of its divisors is an integer number (1377000).
Almost surely, 241956736 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41956736, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (44064000).
41956736 is an abundant number, since it is smaller than the sum of its proper divisors (46171264).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41956736 is a wasteful number, since it uses less digits than its factorization.
41956736 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 259 (or 247 counting only the distinct ones).
The product of its digits is 136080, while the sum is 41.
The square root of 41956736 is about 6477.4019483123. The cubic root of 41956736 is about 347.4832688665.
The spelling of 41956736 in words is "forty-one million, nine hundred fifty-six thousand, seven hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •