Base | Representation |
---|---|
bin | 10010110011110010011101… |
… | …01110011010000001000000 |
3 | 12102110011011211222010211221 |
4 | 21121321032232122001000 |
5 | 20410133040044123022 |
6 | 223545212501244424 |
7 | 11466203226544033 |
oct | 1131711656320100 |
9 | 172404154863757 |
10 | 41361855848512 |
11 | 121a7512363821 |
12 | 4780255a03714 |
13 | 1a105387645a4 |
14 | a2dcd2bab01a |
15 | 4badb4280cc7 |
hex | 259e4eb9a040 |
41361855848512 has 112 divisors (see below), whose sum is σ = 86910285147840. Its totient is φ = 19497140103168.
The previous prime is 41361855848507. The next prime is 41361855848543. The reversal of 41361855848512 is 21584855816314.
It is a super-2 number, since 2×413618558485122 (a number of 28 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 252350778 + ... + 252514630.
It is an arithmetic number, because the mean of its divisors is an integer number (775984688820).
Almost surely, 241361855848512 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 41361855848512, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (43455142573920).
41361855848512 is an abundant number, since it is smaller than the sum of its proper divisors (45548429299328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41361855848512 is a wasteful number, since it uses less digits than its factorization.
41361855848512 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 167100 (or 167090 counting only the distinct ones).
The product of its digits is 36864000, while the sum is 61.
The spelling of 41361855848512 in words is "forty-one trillion, three hundred sixty-one billion, eight hundred fifty-five million, eight hundred forty-eight thousand, five hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •