Base | Representation |
---|---|
bin | 101000110000011110100… |
… | …0011000000000000111011 |
3 | 201211111212102110200220102 |
4 | 1101200331003000000323 |
5 | 1213234200324110101 |
6 | 15525211235350015 |
7 | 1115464252363145 |
oct | 121407503000073 |
9 | 21744772420812 |
10 | 5601661550651 |
11 | 186a718a01711 |
12 | 76578115230b |
13 | 31830802822a |
14 | 15519c583c95 |
15 | 9aaa339a86b |
hex | 5183d0c003b |
5601661550651 has 4 divisors (see below), whose sum is σ = 5657123546304. Its totient is φ = 5546199555000.
The previous prime is 5601661550599. The next prime is 5601661550659. The reversal of 5601661550651 is 1560551661065.
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 5601661550651 - 26 = 5601661550587 is a prime.
It is a super-3 number, since 3×56016615506513 (a number of 39 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5601661550596 and 5601661550605.
It is not an unprimeable number, because it can be changed into a prime (5601661550659) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 27730997675 + ... + 27730997876.
It is an arithmetic number, because the mean of its divisors is an integer number (1414280886576).
Almost surely, 25601661550651 is an apocalyptic number.
5601661550651 is a deficient number, since it is larger than the sum of its proper divisors (55461995653).
5601661550651 is a wasteful number, since it uses less digits than its factorization.
5601661550651 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55461995652.
The product of its (nonzero) digits is 810000, while the sum is 47.
The spelling of 5601661550651 in words is "five trillion, six hundred one billion, six hundred sixty-one million, five hundred fifty thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •