Base | Representation |
---|---|
bin | 1001011100100000010010… |
… | …11110001111110010000011 |
3 | 2201112122121021101121000002 |
4 | 10232100021132033302003 |
5 | 10210301212404023423 |
6 | 112101520315350215 |
7 | 4242425226330305 |
oct | 456201136176203 |
9 | 81478537347002 |
10 | 20770620767363 |
11 | 6688852a30485 |
12 | 23b559aa5236b |
13 | b7887968568c |
14 | 51b4367a9975 |
15 | 260458cc0228 |
hex | 12e40978fc83 |
20770620767363 has 4 divisors (see below), whose sum is σ = 20954431570728. Its totient is φ = 20586809964000.
The previous prime is 20770620767329. The next prime is 20770620767417. The reversal of 20770620767363 is 36376702607702.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 20770620767363 - 210 = 20770620766339 is a prime.
It is a super-2 number, since 2×207706207673632 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20770620767299 and 20770620767308.
It is not an unprimeable number, because it can be changed into a prime (20770620767063) 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, 91905401513 + ... + 91905401738.
It is an arithmetic number, because the mean of its divisors is an integer number (5238607892682).
Almost surely, 220770620767363 is an apocalyptic number.
20770620767363 is a deficient number, since it is larger than the sum of its proper divisors (183810803365).
20770620767363 is a wasteful number, since it uses less digits than its factorization.
20770620767363 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 183810803364.
The product of its (nonzero) digits is 18670176, while the sum is 56.
The spelling of 20770620767363 in words is "twenty trillion, seven hundred seventy billion, six hundred twenty million, seven hundred sixty-seven thousand, three hundred sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •