Base | Representation |
---|---|
bin | 100110011110010110… |
… | …101001110101001100 |
3 | 10221122001202210212121 |
4 | 212132112221311030 |
5 | 1134101212204200 |
6 | 30551143342324 |
7 | 2661510324400 |
oct | 463626516514 |
9 | 127561683777 |
10 | 41311444300 |
11 | 1657a262605 |
12 | 800b1519a4 |
13 | 3b849965c9 |
14 | 1ddc82b100 |
15 | 111bbd7e1a |
hex | 99e5a9d4c |
41311444300 has 108 divisors (see below), whose sum is σ = 106501245984. Its totient is φ = 13862486400.
The previous prime is 41311444297. The next prime is 41311444333. The reversal of 41311444300 is 344411314.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 140610 + ... + 319990.
It is an arithmetic number, because the mean of its divisors is an integer number (986122648).
Almost surely, 241311444300 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 41311444300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (53250622992).
41311444300 is an abundant number, since it is smaller than the sum of its proper divisors (65189801684).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41311444300 is a wasteful number, since it uses less digits than its factorization.
41311444300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 179456 (or 179442 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 41311444300 its reverse (344411314), we get a palindrome (41655855614).
The spelling of 41311444300 in words is "forty-one billion, three hundred eleven million, four hundred forty-four thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •