Base | Representation |
---|---|
bin | 101000110000001101111… |
… | …1010001110000001011101 |
3 | 201211110102200100111210222 |
4 | 1101200123322032001131 |
5 | 1213232031013204410 |
6 | 15525040135411125 |
7 | 1115444422030424 |
oct | 121403372160135 |
9 | 21743380314728 |
10 | 5601105600605 |
11 | 186a463100169 |
12 | 765646b23aa5 |
13 | 318249ab36c8 |
14 | 1551487c62bb |
15 | 9aa6e67e955 |
hex | 5181be8e05d |
5601105600605 has 4 divisors (see below), whose sum is σ = 6721326720732. Its totient is φ = 4480884480480.
The previous prime is 5601105600599. The next prime is 5601105600611. The reversal of 5601105600605 is 5060065011065.
It is a semiprime because it is the product of two primes.
It is an interprime number because it is at equal distance from previous prime (5601105600599) and next prime (5601105600611).
It can be written as a sum of positive squares in 2 ways, for example, as 1815349327801 + 3785756272804 = 1347349^2 + 1945702^2 .
It is not a de Polignac number, because 5601105600605 - 240 = 4501593972829 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 560110560056 + ... + 560110560065.
It is an arithmetic number, because the mean of its divisors is an integer number (1680331680183).
Almost surely, 25601105600605 is an apocalyptic number.
It is an amenable number.
5601105600605 is a deficient number, since it is larger than the sum of its proper divisors (1120221120127).
5601105600605 is a wasteful number, since it uses less digits than its factorization.
5601105600605 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1120221120126.
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 5601105600605 in words is "five trillion, six hundred one billion, one hundred five million, six hundred thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •