Base | Representation |
---|---|
bin | 1001110110011… |
… | …0111011010000 |
3 | 2212202001222000 |
4 | 2131212323100 |
5 | 41034103143 |
6 | 4033314000 |
7 | 1011115644 |
oct | 235467320 |
9 | 85661860 |
10 | 41316048 |
11 | 2135a3a4 |
12 | 11a05900 |
13 | 8737887 |
14 | 56b6c24 |
15 | 3961bd3 |
hex | 2766ed0 |
41316048 has 80 divisors (see below), whose sum is σ = 120676800. Its totient is φ = 13530240.
The previous prime is 41316031. The next prime is 41316059. The reversal of 41316048 is 84061314.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 24678 + ... + 26298.
It is an arithmetic number, because the mean of its divisors is an integer number (1508460).
Almost surely, 241316048 is an apocalyptic number.
41316048 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41316048, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (60338400).
41316048 is an abundant number, since it is smaller than the sum of its proper divisors (79360752).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41316048 is a wasteful number, since it uses less digits than its factorization.
41316048 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1697 (or 1685 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 27.
The square root of 41316048 is about 6427.7560625774. The cubic root of 41316048 is about 345.7054751366.
It can be divided in two parts, 413 and 16048, that added together give a palindrome (16461).
The spelling of 41316048 in words is "forty-one million, three hundred sixteen thousand, forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •