Base | Representation |
---|---|
bin | 101000110100110100110… |
… | …1010100101101001011111 |
3 | 201212101222020112011010222 |
4 | 1101221221222211221133 |
5 | 1213412312003414021 |
6 | 15533354032151555 |
7 | 1116244545404336 |
oct | 121515152455137 |
9 | 21771866464128 |
10 | 5611000060511 |
11 | 187368028a35a |
12 | 7675486985bb |
13 | 31916596a801 |
14 | 155806914d1d |
15 | 9ae4d1416ab |
hex | 51a69aa5a5f |
5611000060511 has 4 divisors (see below), whose sum is σ = 5611021650024. Its totient is φ = 5610978471000.
The previous prime is 5611000060507. The next prime is 5611000060651. The reversal of 5611000060511 is 1150600001165.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 5611000060511 - 22 = 5611000060507 is a prime.
It is a super-2 number, since 2×56110000605112 (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 (5611000060111) by changing a digit.
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 3 ways as a sum of consecutive naturals, for example, 10400105 + ... + 10926306.
It is an arithmetic number, because the mean of its divisors is an integer number (1402755412506).
Almost surely, 25611000060511 is an apocalyptic number.
5611000060511 is a deficient number, since it is larger than the sum of its proper divisors (21589513).
5611000060511 is a wasteful number, since it uses less digits than its factorization.
5611000060511 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21589512.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 5611000060511 its reverse (1150600001165), we get a palindrome (6761600061676).
The spelling of 5611000060511 in words is "five trillion, six hundred eleven billion, sixty thousand, five hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •