Base | Representation |
---|---|
bin | 11001101111100110011010… |
… | …00110111011010010001010 |
3 | 21102102222011121011202010222 |
4 | 30313303031012323102022 |
5 | 24410004023141400000 |
6 | 320222441314510042 |
7 | 14632006040216540 |
oct | 1467631506732212 |
9 | 242388147152128 |
10 | 56611110106250 |
11 | 17046700896327 |
12 | 6423742295322 |
13 | 25785353a942b |
14 | dd9dc700dd90 |
15 | 6828b9003a85 |
hex | 337ccd1bb48a |
56611110106250 has 48 divisors (see below), whose sum is σ = 121301757940608. Its totient is φ = 19409523450000.
The previous prime is 56611110106211. The next prime is 56611110106339. The reversal of 56611110106250 is 5260101111665.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (35).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 56611110106250.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 646940366 + ... + 647027865.
It is an arithmetic number, because the mean of its divisors is an integer number (2527119957096).
Almost surely, 256611110106250 is an apocalyptic number.
56611110106250 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56611110106250 is an abundant number, since it is smaller than the sum of its proper divisors (64690647834358).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56611110106250 is an equidigital number, since it uses as much as digits as its factorization.
56611110106250 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1293968265 (or 1293968245 counting only the distinct ones).
The product of its (nonzero) digits is 10800, while the sum is 35.
The spelling of 56611110106250 in words is "fifty-six trillion, six hundred eleven billion, one hundred ten million, one hundred six thousand, two hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •