Base | Representation |
---|---|
bin | 100110011111001010… |
… | …010100110000111000 |
3 | 10221200000020222101112 |
4 | 212133022110300320 |
5 | 1134113144130441 |
6 | 30552345535452 |
7 | 2662033420640 |
oct | 463712246070 |
9 | 127600228345 |
10 | 41324989496 |
11 | 1658697428a |
12 | 80137a4588 |
13 | 3b87729a0b |
14 | 2000555520 |
15 | 111ceb14eb |
hex | 99f294c38 |
41324989496 has 128 divisors (see below), whose sum is σ = 93185241600. Its totient is φ = 16812956160.
The previous prime is 41324989471. The next prime is 41324989501. The reversal of 41324989496 is 69498942314.
It is a Smith number, since the sum of its digits (59) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 15130451 + ... + 15133181.
It is an arithmetic number, because the mean of its divisors is an integer number (728009700).
Almost surely, 241324989496 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 41324989496, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (46592620800).
41324989496 is an abundant number, since it is smaller than the sum of its proper divisors (51860252104).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41324989496 is a wasteful number, since it uses less digits than its factorization.
41324989496 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2957 (or 2953 counting only the distinct ones).
The product of its digits is 13436928, while the sum is 59.
The spelling of 41324989496 in words is "forty-one billion, three hundred twenty-four million, nine hundred eighty-nine thousand, four hundred ninety-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •