Base | Representation |
---|---|
bin | 11100000000110101110000… |
… | …01010000110111001010001 |
3 | 22002010001021012011021102120 |
4 | 32000122320022012321101 |
5 | 31033234343204213112 |
6 | 335003202053004453 |
7 | 15655363600525614 |
oct | 1600327012067121 |
9 | 262101235137376 |
10 | 61601510616657 |
11 | 186a0065882210 |
12 | 6aaa951323729 |
13 | 284acc7742c2b |
14 | 112d7598cc17b |
15 | 71c5e3acbe8c |
hex | 3806b8286e51 |
61601510616657 has 8 divisors (see below), whose sum is σ = 89602197260640. Its totient is φ = 37334248858560.
The previous prime is 61601510616593. The next prime is 61601510616671. The reversal of 61601510616657 is 75661601510616.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 61601510616657 - 26 = 61601510616593 is a prime.
It is a super-2 number, since 2×616015106166572 (a number of 28 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (61601510617657) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 933356221432 + ... + 933356221497.
It is an arithmetic number, because the mean of its divisors is an integer number (11200274657580).
Almost surely, 261601510616657 is an apocalyptic number.
It is an amenable number.
61601510616657 is a deficient number, since it is larger than the sum of its proper divisors (28000686643983).
61601510616657 is a wasteful number, since it uses less digits than its factorization.
61601510616657 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1866712442943.
The product of its (nonzero) digits is 1360800, while the sum is 51.
The spelling of 61601510616657 in words is "sixty-one trillion, six hundred one billion, five hundred ten million, six hundred sixteen thousand, six hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •