Base | Representation |
---|---|
bin | 10011000101001111011111… |
… | …10100000010110000000000 |
3 | 12111120111010012002021000120 |
4 | 21202213233310002300000 |
5 | 20444444233040141000 |
6 | 225124512443220240 |
7 | 11560423355511660 |
oct | 1142475764026000 |
9 | 174514105067016 |
10 | 41961558912000 |
11 | 12408885085542 |
12 | 4858521217680 |
13 | 1a54c5ba27500 |
14 | a50d438381a0 |
15 | 4cb7b2ee76a0 |
hex | 2629efd02c00 |
41961558912000 has 2112 divisors, whose sum is σ = 175302047950848. Its totient is φ = 8722022400000.
The previous prime is 41961558911999. The next prime is 41961558912017. The reversal of 41961558912000 is 21985516914.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 32253311350 + ... + 32253312650.
Almost surely, 241961558912000 is an apocalyptic number.
41961558912000 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 41961558912000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (87651023975424).
41961558912000 is an abundant number, since it is smaller than the sum of its proper divisors (133340489038848).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
41961558912000 is a wasteful number, since it uses less digits than its factorization.
41961558912000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1443 (or 1402 counting only the distinct ones).
The product of its (nonzero) digits is 777600, while the sum is 51.
The spelling of 41961558912000 in words is "forty-one trillion, nine hundred sixty-one billion, five hundred fifty-eight million, nine hundred twelve thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •