Base | Representation |
---|---|
bin | 1011011000100000… |
… | …00000000010000101 |
3 | 120202220010002200100 |
4 | 11230100000002011 |
5 | 100003420213221 |
6 | 2450222034313 |
7 | 304303334112 |
oct | 55420000205 |
9 | 16686102610 |
10 | 6111101061 |
11 | 265661474a |
12 | 1226718999 |
13 | 7650c8340 |
14 | 41d88d909 |
15 | 25b781926 |
hex | 16c400085 |
6111101061 has 24 divisors (see below), whose sum is σ = 10065346200. Its totient is φ = 3539460096.
The previous prime is 6111101057. The next prime is 6111101089. The reversal of 6111101061 is 1601011116.
It can be written as a sum of positive squares in 4 ways, for example, as 630512100 + 5480588961 = 25110^2 + 74031^2 .
It is not a de Polignac number, because 6111101061 - 22 = 6111101057 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6111101561) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1534236 + ... + 1538213.
It is an arithmetic number, because the mean of its divisors is an integer number (419389425).
Almost surely, 26111101061 is an apocalyptic number.
It is an amenable number.
6111101061 is a deficient number, since it is larger than the sum of its proper divisors (3954245139).
6111101061 is a wasteful number, since it uses less digits than its factorization.
6111101061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3072485 (or 3072482 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 18.
The square root of 6111101061 is about 78173.5317163041. The cubic root of 6111101061 is about 1828.2678485755.
Adding to 6111101061 its reverse (1601011116), we get a palindrome (7712112177).
It can be divided in two parts, 611110 and 1061, that added together give a triangular number (612171 = T1106).
The spelling of 6111101061 in words is "six billion, one hundred eleven million, one hundred one thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •