Base | Representation |
---|---|
bin | 1011010010100100… |
… | …00100010010100101 |
3 | 120122102102111202020 |
4 | 11221102010102211 |
5 | 44403143424031 |
6 | 2441242533353 |
7 | 303130203024 |
oct | 55122042245 |
9 | 16572374666 |
10 | 6061311141 |
11 | 26304a7856 |
12 | 1211b07259 |
13 | 7579b4752 |
14 | 41700c8bb |
15 | 2571e9096 |
hex | 1694844a5 |
6061311141 has 16 divisors (see below), whose sum is σ = 8723928960. Its totient is φ = 3731900480.
The previous prime is 6061311127. The next prime is 6061311161. The reversal of 6061311141 is 1411131606.
It is a cyclic number.
It is not a de Polignac number, because 6061311141 - 215 = 6061278373 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (6061311161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1512570 + ... + 1516571.
It is an arithmetic number, because the mean of its divisors is an integer number (545245560).
Almost surely, 26061311141 is an apocalyptic number.
It is an amenable number.
6061311141 is a deficient number, since it is larger than the sum of its proper divisors (2662617819).
6061311141 is a wasteful number, since it uses less digits than its factorization.
6061311141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3029196.
The product of its (nonzero) digits is 432, while the sum is 24.
The square root of 6061311141 is about 77854.4227452750. The cubic root of 6061311141 is about 1823.2890592548.
Adding to 6061311141 its reverse (1411131606), we get a palindrome (7472442747).
It can be divided in two parts, 60 and 61311141, that added together give a triangular number (61311201 = T11073).
The spelling of 6061311141 in words is "six billion, sixty-one million, three hundred eleven thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •