Base | Representation |
---|---|
bin | 1001011101000101110110… |
… | …01111101110100001101001 |
3 | 2201121120122102112000022122 |
4 | 10232202323033232201221 |
5 | 10211114010443043021 |
6 | 112115053130001025 |
7 | 4244040663061205 |
oct | 456427317564151 |
9 | 81546572460278 |
10 | 20790783174761 |
11 | 669635a0a6596 |
12 | 23b9487276175 |
13 | b7a7408b4762 |
14 | 51c3ca489b05 |
15 | 260c38e1bbab |
hex | 12e8bb3ee869 |
20790783174761 has 4 divisors (see below), whose sum is σ = 20797039808592. Its totient is φ = 20784526540932.
The previous prime is 20790783174751. The next prime is 20790783174781. The reversal of 20790783174761 is 16747138709702.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 20790783174761 - 26 = 20790783174697 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20790783174694 and 20790783174703.
It is not an unprimeable number, because it can be changed into a prime (20790783174751) 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, 3128311931 + ... + 3128318576.
It is an arithmetic number, because the mean of its divisors is an integer number (5199259952148).
Almost surely, 220790783174761 is an apocalyptic number.
It is an amenable number.
20790783174761 is a deficient number, since it is larger than the sum of its proper divisors (6256633831).
20790783174761 is an equidigital number, since it uses as much as digits as its factorization.
20790783174761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6256633830.
The product of its (nonzero) digits is 24893568, while the sum is 62.
The spelling of 20790783174761 in words is "twenty trillion, seven hundred ninety billion, seven hundred eighty-three million, one hundred seventy-four thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •