Base | Representation |
---|---|
bin | 10011001110111000… |
… | …000010010001100101 |
3 | 1222022011212110220201 |
4 | 103032320002101211 |
5 | 314243032240221 |
6 | 13253051230501 |
7 | 1330512520405 |
oct | 231670022145 |
9 | 58264773821 |
10 | 20650665061 |
11 | 8837842344 |
12 | 4003a48431 |
13 | 1c41432550 |
14 | ddc89a805 |
15 | 80ce45891 |
hex | 4cee02465 |
20650665061 has 8 divisors (see below), whose sum is σ = 22243084920. Its totient is φ = 19058803392.
The previous prime is 20650665053. The next prime is 20650665151. The reversal of 20650665061 is 16056605602.
It can be written as a sum of positive squares in 4 ways, for example, as 2020053025 + 18630612036 = 44945^2 + 136494^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20650665061 - 23 = 20650665053 is a prime.
It is a super-2 number, since 2×206506650612 (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 20650665061.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20650665661) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 61066 + ... + 212203.
It is an arithmetic number, because the mean of its divisors is an integer number (2780385615).
Almost surely, 220650665061 is an apocalyptic number.
It is an amenable number.
20650665061 is a deficient number, since it is larger than the sum of its proper divisors (1592419859).
20650665061 is a wasteful number, since it uses less digits than its factorization.
20650665061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 279095.
The product of its (nonzero) digits is 64800, while the sum is 37.
The spelling of 20650665061 in words is "twenty billion, six hundred fifty million, six hundred sixty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •