Base | Representation |
---|---|
bin | 10011010000101000… |
… | …100100100100000100 |
3 | 1222101020101021002121 |
4 | 103100220210210010 |
5 | 314323110300021 |
6 | 13300023415324 |
7 | 1331321336044 |
oct | 232050444404 |
9 | 58336337077 |
10 | 20680165636 |
11 | 8852461589 |
12 | 40118b4544 |
13 | 1c47591100 |
14 | 1002779724 |
15 | 810821741 |
hex | 4d0a24904 |
20680165636 has 27 divisors (see below), whose sum is σ = 39195388533. Its totient is φ = 9542966160.
The previous prime is 20680165633. The next prime is 20680165637. The reversal of 20680165636 is 63656108602.
The square root of 20680165636 is 143806.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in only one way, i.e., 3059196100 + 17620969536 = 55310^2 + 132744^2 .
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20680165592 and 20680165601.
It is not an unprimeable number, because it can be changed into a prime (20680165633) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 3736191 + ... + 3741721.
Almost surely, 220680165636 is an apocalyptic number.
20680165636 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
20680165636 is the 143806-th square number.
It is an amenable number.
20680165636 is a deficient number, since it is larger than the sum of its proper divisors (18515222897).
20680165636 is an frugal number, since it uses more digits than its factorization.
20680165636 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11092 (or 5546 counting only the distinct ones).
The product of its (nonzero) digits is 311040, while the sum is 43.
The spelling of 20680165636 in words is "twenty billion, six hundred eighty million, one hundred sixty-five thousand, six hundred thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •