Base | Representation |
---|---|
bin | 10011010000011010… |
… | …111001001001111001 |
3 | 1222100222122002110211 |
4 | 103100122321021321 |
5 | 314321201024321 |
6 | 13255414511121 |
7 | 1331246013142 |
oct | 232032711171 |
9 | 58328562424 |
10 | 20676579961 |
11 | 8850432614 |
12 | 40106654a1 |
13 | 1c46906ccb |
14 | 10020c4ac9 |
15 | 8103640e1 |
hex | 4d06b9279 |
20676579961 has 4 divisors (see below), whose sum is σ = 20751224932. Its totient is φ = 20601934992.
The previous prime is 20676579899. The next prime is 20676579967. The reversal of 20676579961 is 16997567602.
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 13393664361 + 7282915600 = 115731^2 + 85340^2 .
It is a cyclic number.
It is not a de Polignac number, because 20676579961 - 217 = 20676448889 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20676579896 and 20676579905.
It is not an unprimeable number, because it can be changed into a prime (20676579967) 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, 37322070 + ... + 37322623.
It is an arithmetic number, because the mean of its divisors is an integer number (5187806233).
Almost surely, 220676579961 is an apocalyptic number.
It is an amenable number.
20676579961 is a deficient number, since it is larger than the sum of its proper divisors (74644971).
20676579961 is an equidigital number, since it uses as much as digits as its factorization.
20676579961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 74644970.
The product of its (nonzero) digits is 8573040, while the sum is 58.
The spelling of 20676579961 in words is "twenty billion, six hundred seventy-six million, five hundred seventy-nine thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •