Base | Representation |
---|---|
bin | 11001101101101010111000… |
… | …10010000000101100010110 |
3 | 21102012121222211020021211220 |
4 | 30312311130102000230112 |
5 | 24402412213411132032 |
6 | 320132152534111210 |
7 | 14624140450323300 |
oct | 1466653422005426 |
9 | 242177884207756 |
10 | 56544792677142 |
11 | 1702056a38a280 |
12 | 64129147ab506 |
13 | 25721c6b92513 |
14 | dd6ad551c970 |
15 | 680cd6d6512c |
hex | 336d5c480b16 |
56544792677142 has 192 divisors, whose sum is σ = 151988752491264. Its totient is φ = 13819903426560.
The previous prime is 56544792677101. The next prime is 56544792677209. The reversal of 56544792677142 is 24177629744565.
It is a Smith number, since the sum of its digits (69) coincides with the sum of the digits of its prime factors.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 95 ways as a sum of consecutive naturals, for example, 248551798 + ... + 248779190.
It is an arithmetic number, because the mean of its divisors is an integer number (791608085892).
Almost surely, 256544792677142 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 56544792677142, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (75994376245632).
56544792677142 is an abundant number, since it is smaller than the sum of its proper divisors (95443959814122).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56544792677142 is a wasteful number, since it uses less digits than its factorization.
56544792677142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231963 (or 231956 counting only the distinct ones).
The product of its digits is 711244800, while the sum is 69.
The spelling of 56544792677142 in words is "fifty-six trillion, five hundred forty-four billion, seven hundred ninety-two million, six hundred seventy-seven thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •