Base | Representation |
---|---|
bin | 101100011101101011101… |
… | …0011000110110011110000 |
3 | 210122012200222020211001220 |
4 | 1120323113103012303300 |
5 | 1300110420213324401 |
6 | 20555214042025040 |
7 | 1200336440403150 |
oct | 130732723066360 |
9 | 23565628224056 |
10 | 6111055604976 |
11 | 1a46758635173 |
12 | 8284441a8180 |
13 | 35436846551a |
14 | 171ac3276760 |
15 | a8e68a97336 |
hex | 58ed74c6cf0 |
6111055604976 has 160 divisors (see below), whose sum is σ = 18665816739840. Its totient is φ = 1685672153088.
The previous prime is 6111055604957. The next prime is 6111055604993. The reversal of 6111055604976 is 6794065501116.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 208575160 + ... + 208604456.
It is an arithmetic number, because the mean of its divisors is an integer number (116661354624).
Almost surely, 26111055604976 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 6111055604976, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (9332908369920).
6111055604976 is an abundant number, since it is smaller than the sum of its proper divisors (12554761134864).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
6111055604976 is a wasteful number, since it uses less digits than its factorization.
6111055604976 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 50751 (or 50745 counting only the distinct ones).
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 6111055604976 in words is "six trillion, one hundred eleven billion, fifty-five million, six hundred four thousand, nine hundred seventy-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •