Base | Representation |
---|---|
bin | 100110011110011001… |
… | …100111010101010100 |
3 | 10221122010020020121202 |
4 | 212132121213111110 |
5 | 1134101412024000 |
6 | 30551212132032 |
7 | 2661520036355 |
oct | 463631472524 |
9 | 127563206552 |
10 | 41312220500 |
11 | 1657a7427a1 |
12 | 800b467018 |
13 | 3b84ba89b5 |
14 | 1ddc98dd2c |
15 | 111bcdcdd5 |
hex | 99e667554 |
41312220500 has 192 divisors, whose sum is σ = 97996953600. Its totient is φ = 15172185600.
The previous prime is 41312220451. The next prime is 41312220511. The reversal of 41312220500 is 502221314.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a congruent number.
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 63 ways as a sum of consecutive naturals, for example, 33613886 + ... + 33615114.
It is an arithmetic number, because the mean of its divisors is an integer number (510400800).
Almost surely, 241312220500 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 41312220500, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (48998476800).
41312220500 is an abundant number, since it is smaller than the sum of its proper divisors (56684733100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41312220500 is a wasteful number, since it uses less digits than its factorization.
41312220500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1387 (or 1375 counting only the distinct ones).
The product of its (nonzero) digits is 480, while the sum is 20.
Adding to 41312220500 its reverse (502221314), we get a palindrome (41814441814).
The spelling of 41312220500 in words is "forty-one billion, three hundred twelve million, two hundred twenty thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •