Base | Representation |
---|---|
bin | 101000110101001010111… |
… | …0111011000101001110101 |
3 | 201212110212220212220110102 |
4 | 1101222111313120221311 |
5 | 1213420321323101121 |
6 | 15533555402203445 |
7 | 1116302121450062 |
oct | 121522567305165 |
9 | 21773786786412 |
10 | 5611741612661 |
11 | 1873a2092a478 |
12 | 767714ab3585 |
13 | 319253498072 |
14 | 1558771c7c69 |
15 | 9ae932c090b |
hex | 51a95dd8a75 |
5611741612661 has 8 divisors (see below), whose sum is σ = 5907197368800. Its totient is φ = 5316295950000.
The previous prime is 5611741612649. The next prime is 5611741612669. The reversal of 5611741612661 is 1662161471165.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-5611741612661 is a prime.
It is a super-3 number, since 3×56117416126613 (a number of 39 digits) contains 333 as substring.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5611741612669) 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 7 ways as a sum of consecutive naturals, for example, 1368590 + ... + 3618911.
It is an arithmetic number, because the mean of its divisors is an integer number (738399671100).
Almost surely, 25611741612661 is an apocalyptic number.
It is an amenable number.
5611741612661 is a deficient number, since it is larger than the sum of its proper divisors (295455756139).
5611741612661 is a wasteful number, since it uses less digits than its factorization.
5611741612661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5046739.
The product of its digits is 362880, while the sum is 47.
The spelling of 5611741612661 in words is "five trillion, six hundred eleven billion, seven hundred forty-one million, six hundred twelve thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •