Base | Representation |
---|---|
bin | 101000110010100001100… |
… | …1111101010010001011101 |
3 | 201211221012222212111001122 |
4 | 1101211003033222101131 |
5 | 1213322202442000221 |
6 | 15531215540220325 |
7 | 1116011256004430 |
oct | 121450317522135 |
9 | 21757188774048 |
10 | 5606060500061 |
11 | 187157600349a |
12 | 7665aa39a6a5 |
13 | 3188594b0c88 |
14 | 1554988a7817 |
15 | 9ac5e677eab |
hex | 519433ea45d |
5606060500061 has 32 divisors (see below), whose sum is σ = 6443775763200. Its totient is φ = 4777662113280.
The previous prime is 5606060500039. The next prime is 5606060500123. The reversal of 5606060500061 is 1600050606065.
It is not a de Polignac number, because 5606060500061 - 210 = 5606060499037 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5606060499994 and 5606060500030.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5606060500031) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1315665671 + ... + 1315669931.
It is an arithmetic number, because the mean of its divisors is an integer number (201367992600).
Almost surely, 25606060500061 is an apocalyptic number.
It is an amenable number.
5606060500061 is a deficient number, since it is larger than the sum of its proper divisors (837715263139).
5606060500061 is a wasteful number, since it uses less digits than its factorization.
5606060500061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6069.
The product of its (nonzero) digits is 32400, while the sum is 35.
The spelling of 5606060500061 in words is "five trillion, six hundred six billion, sixty million, five hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •