Base | Representation |
---|---|
bin | 10010101101100101110001… |
… | …00001101110101110100000 |
3 | 12101200210110101010101100220 |
4 | 21112302320201232232200 |
5 | 20343140402412424233 |
6 | 223303311412243040 |
7 | 11444623445413260 |
oct | 1126627041565640 |
9 | 171623411111326 |
10 | 41148882545568 |
11 | 121251634a2056 |
12 | 4746b19610480 |
13 | 19c64277601c5 |
14 | a2388bb0d7a0 |
15 | 4b559bdceeb3 |
hex | 256cb886eba0 |
41148882545568 has 192 divisors, whose sum is σ = 123706799935488. Its totient is φ = 11732067809280.
The previous prime is 41148882545531. The next prime is 41148882545587. The reversal of 41148882545568 is 86554528884114.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 803020428 + ... + 803071668.
It is an arithmetic number, because the mean of its divisors is an integer number (644306249664).
Almost surely, 241148882545568 is an apocalyptic number.
41148882545568 is a gapful number since it is divisible by the number (48) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 41148882545568, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (61853399967744).
41148882545568 is an abundant number, since it is smaller than the sum of its proper divisors (82557917389920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41148882545568 is a wasteful number, since it uses less digits than its factorization.
41148882545568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 53755 (or 53747 counting only the distinct ones).
The product of its digits is 393216000, while the sum is 69.
The spelling of 41148882545568 in words is "forty-one trillion, one hundred forty-eight billion, eight hundred eighty-two million, five hundred forty-five thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •