Base | Representation |
---|---|
bin | 11001010110011011110101… |
… | …00011101001011101100000 |
3 | 21022101022022000121120020202 |
4 | 30223031322203221131200 |
5 | 24301322200243400000 |
6 | 314321320502524332 |
7 | 14512355445432644 |
oct | 1453157243513540 |
9 | 238338260546222 |
10 | 55746436700000 |
11 | 16842a27235262 |
12 | 6304048a366a8 |
13 | 2514b356c3547 |
14 | daa1db66ac24 |
15 | 66a15d06add5 |
hex | 32b37a8e9760 |
55746436700000 has 288 divisors, whose sum is σ = 138293127173376. Its totient is φ = 22118040000000.
The previous prime is 55746436699997. The next prime is 55746436700023. The reversal of 55746436700000 is 763464755.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 11883697655 + ... + 11883702345.
It is an arithmetic number, because the mean of its divisors is an integer number (480184469352).
Almost surely, 255746436700000 is an apocalyptic number.
55746436700000 is a gapful number since it is divisible by the number (50) 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 55746436700000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (69146563586688).
55746436700000 is an abundant number, since it is smaller than the sum of its proper divisors (82546690473376).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
55746436700000 is an equidigital number, since it uses as much as digits as its factorization.
55746436700000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5664 (or 5636 counting only the distinct ones).
The product of its (nonzero) digits is 2116800, while the sum is 47.
The spelling of 55746436700000 in words is "fifty-five trillion, seven hundred forty-six billion, four hundred thirty-six million, seven hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •