Base | Representation |
---|---|
bin | 100110101001000101… |
… | …011100010101100000 |
3 | 10222002121112200002210 |
4 | 212221011130111200 |
5 | 1134433304410302 |
6 | 31021054242120 |
7 | 2666124530454 |
oct | 465105342540 |
9 | 128077480083 |
10 | 41491481952 |
11 | 16661950558 |
12 | 805b4b6340 |
13 | 3bb308166b |
14 | 20186d4664 |
15 | 112c8ec66c |
hex | 9a915c560 |
41491481952 has 96 divisors (see below), whose sum is σ = 115783153920. Its totient is φ = 12972787200.
The previous prime is 41491481939. The next prime is 41491481957. The reversal of 41491481952 is 25918419414.
It is a tau number, because it is divible by the number of its divisors (96).
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (41491481957) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 71613 + ... + 296835.
It is an arithmetic number, because the mean of its divisors is an integer number (1206074520).
Almost surely, 241491481952 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 41491481952, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (57891576960).
41491481952 is an abundant number, since it is smaller than the sum of its proper divisors (74291671968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41491481952 is a wasteful number, since it uses less digits than its factorization.
41491481952 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 225356 (or 225348 counting only the distinct ones).
The product of its digits is 414720, while the sum is 48.
The spelling of 41491481952 in words is "forty-one billion, four hundred ninety-one million, four hundred eighty-one thousand, nine hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •