Base | Representation |
---|---|
bin | 111001011111010000… |
… | …100000101001101001 |
3 | 12220022220120100102102 |
4 | 321133100200221221 |
5 | 2002404243040310 |
6 | 44205102543145 |
7 | 4313445561401 |
oct | 713720405151 |
9 | 186286510372 |
10 | 61727705705 |
11 | 241a6753a16 |
12 | bb68597ab5 |
13 | 5a89687363 |
14 | 2db810b801 |
15 | 191427a8a5 |
hex | e5f420a69 |
61727705705 has 4 divisors (see below), whose sum is σ = 74073246852. Its totient is φ = 49382164560.
The previous prime is 61727705671. The next prime is 61727705707. The reversal of 61727705705 is 50750772716.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 46661616169 + 15066089536 = 216013^2 + 122744^2 .
It is a de Polignac number, because none of the positive numbers 2k-61727705705 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 61727705705.
It is not an unprimeable number, because it can be changed into a prime (61727705707) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 6172770566 + ... + 6172770575.
It is an arithmetic number, because the mean of its divisors is an integer number (18518311713).
Almost surely, 261727705705 is an apocalyptic number.
It is an amenable number.
61727705705 is a deficient number, since it is larger than the sum of its proper divisors (12345541147).
61727705705 is a wasteful number, since it uses less digits than its factorization.
61727705705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12345541146.
The product of its (nonzero) digits is 720300, while the sum is 47.
The spelling of 61727705705 in words is "sixty-one billion, seven hundred twenty-seven million, seven hundred five thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •