Base | Representation |
---|---|
bin | 101011101111000111100… |
… | …1000011011110100101111 |
3 | 210021122121011000020212012 |
4 | 1113132033020123310233 |
5 | 1241441123003200421 |
6 | 20441235414031435 |
7 | 1160166454030550 |
oct | 127361710336457 |
9 | 23248534006765 |
10 | 6011060600111 |
11 | 1a08305000a86 |
12 | 810b9804857b |
13 | 347ac09b45a8 |
14 | 16ad18b56327 |
15 | a6564ee795b |
hex | 5778f21bd2f |
6011060600111 has 32 divisors (see below), whose sum is σ = 6993934800000. Its totient is φ = 5059511009280.
The previous prime is 6011060600081. The next prime is 6011060600113. The reversal of 6011060600111 is 1110060601106.
6011060600111 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a de Polignac number, because none of the positive numbers 2k-6011060600111 is a prime.
It is a super-2 number, since 2×60110606001112 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6011060600113) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 732248375 + ... + 732256583.
It is an arithmetic number, because the mean of its divisors is an integer number (218560462500).
Almost surely, 26011060600111 is an apocalyptic number.
6011060600111 is a gapful number since it is divisible by the number (61) formed by its first and last digit.
6011060600111 is a deficient number, since it is larger than the sum of its proper divisors (982874199889).
6011060600111 is a wasteful number, since it uses less digits than its factorization.
6011060600111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10899.
The product of its (nonzero) digits is 216, while the sum is 23.
The spelling of 6011060600111 in words is "six trillion, eleven billion, sixty million, six hundred thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •