Base | Representation |
---|---|
bin | 10011000101111011… |
… | …111110111100100101 |
3 | 1221220201200201110122 |
4 | 103011323332330211 |
5 | 313441140030221 |
6 | 13230133131325 |
7 | 1324012055264 |
oct | 230573767445 |
9 | 57821621418 |
10 | 20500705061 |
11 | 8770128161 |
12 | 3b81789b45 |
13 | 1c19348915 |
14 | dc69c25db |
15 | 7eebc2eab |
hex | 4c5efef25 |
20500705061 has 4 divisors (see below), whose sum is σ = 20501472012. Its totient is φ = 20499938112.
The previous prime is 20500705031. The next prime is 20500705079. The reversal of 20500705061 is 16050700502.
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 1504974436 + 18995730625 = 38794^2 + 137825^2 .
It is a cyclic number.
It is not a de Polignac number, because 20500705061 - 26 = 20500704997 is a prime.
It is a super-2 number, since 2×205007050612 (a number of 21 digits) contains 22 as substring.
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 20500705061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20500705021) 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, 341876 + ... + 397341.
It is an arithmetic number, because the mean of its divisors is an integer number (5125368003).
Almost surely, 220500705061 is an apocalyptic number.
It is an amenable number.
20500705061 is a deficient number, since it is larger than the sum of its proper divisors (766951).
20500705061 is an equidigital number, since it uses as much as digits as its factorization.
20500705061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 766950.
The product of its (nonzero) digits is 2100, while the sum is 26.
The spelling of 20500705061 in words is "twenty billion, five hundred million, seven hundred five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •