Base | Representation |
---|---|
bin | 10010101101010100101100… |
… | …00110111110100100100000 |
3 | 12101122220210111002120212020 |
4 | 21112222112012332210200 |
5 | 20343013114041011030 |
6 | 223255154011501440 |
7 | 11444150331134430 |
oct | 1126522606764440 |
9 | 171586714076766 |
10 | 41139715172640 |
11 | 12121289783097 |
12 | 474519b457880 |
13 | 19c55c640a596 |
14 | a2325c3aa2c0 |
15 | 4b5212191510 |
hex | 256a961be920 |
41139715172640 has 384 divisors, whose sum is σ = 148827527331840. Its totient is φ = 9357394710528.
The previous prime is 41139715172623. The next prime is 41139715172659. The reversal of 41139715172640 is 4627151793114.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 2112210582 + ... + 2112230058.
It is an arithmetic number, because the mean of its divisors is an integer number (387571685760).
Almost surely, 241139715172640 is an apocalyptic number.
41139715172640 is a gapful number since it is divisible by the number (40) 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 41139715172640, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (74413763665920).
41139715172640 is an abundant number, since it is smaller than the sum of its proper divisors (107687812159200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41139715172640 is a wasteful number, since it uses less digits than its factorization.
41139715172640 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22544 (or 22536 counting only the distinct ones).
The product of its (nonzero) digits is 1270080, while the sum is 51.
The spelling of 41139715172640 in words is "forty-one trillion, one hundred thirty-nine billion, seven hundred fifteen million, one hundred seventy-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •