Base | Representation |
---|---|
bin | 10010110000000100110000… |
… | …11000100110001101000000 |
3 | 12101222221210021011202220222 |
4 | 21120002120120212031000 |
5 | 20401040212103020433 |
6 | 223410425523122212 |
7 | 11454034654213511 |
oct | 1130023030461500 |
9 | 171887707152828 |
10 | 41234242626368 |
11 | 12158386a96180 |
12 | 475b580513368 |
13 | 1a014ac1c935c |
14 | a27a686bca08 |
15 | 4b78e5c30b98 |
hex | 258098626340 |
41234242626368 has 448 divisors, whose sum is σ = 99751797976320. Its totient is φ = 16688136192000.
The previous prime is 41234242626233. The next prime is 41234242626373. The reversal of 41234242626368 is 86362624243214.
It is a Harshad number since it is a multiple of its sum of digits (53).
It is a congruent number.
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, 23931654755 + ... + 23931656477.
It is an arithmetic number, because the mean of its divisors is an integer number (222660263340).
Almost surely, 241234242626368 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 41234242626368, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (49875898988160).
41234242626368 is an abundant number, since it is smaller than the sum of its proper divisors (58517555349952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41234242626368 is a wasteful number, since it uses less digits than its factorization.
41234242626368 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3146 (or 3136 counting only the distinct ones).
The product of its digits is 15925248, while the sum is 53.
The spelling of 41234242626368 in words is "forty-one trillion, two hundred thirty-four billion, two hundred forty-two million, six hundred twenty-six thousand, three hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •