Base | Representation |
---|---|
bin | 100110011110100100… |
… | …100110100111100000 |
3 | 10221122022122121010120 |
4 | 212132210212213200 |
5 | 1134103131214102 |
6 | 30551354000240 |
7 | 2661553364643 |
oct | 463644464740 |
9 | 127568577116 |
10 | 41315101152 |
11 | 1658132aaa6 |
12 | 8010416080 |
13 | 3b85676c20 |
14 | 1ddd0dda5a |
15 | 111c1ab6bc |
hex | 99e9269e0 |
41315101152 has 192 divisors, whose sum is σ = 123177438720. Its totient is φ = 12020189184.
The previous prime is 41315101141. The next prime is 41315101211. The reversal of 41315101152 is 25110151314.
It is a Harshad number since it is a multiple of its sum of digits (24).
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, 15340318 + ... + 15343010.
It is an arithmetic number, because the mean of its divisors is an integer number (641549160).
Almost surely, 241315101152 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 41315101152, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61588719360).
41315101152 is an abundant number, since it is smaller than the sum of its proper divisors (81862337568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41315101152 is a wasteful number, since it uses less digits than its factorization.
41315101152 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3385 (or 3377 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 24.
Adding to 41315101152 its reverse (25110151314), we get a palindrome (66425252466).
The spelling of 41315101152 in words is "forty-one billion, three hundred fifteen million, one hundred one thousand, one hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •