Base | Representation |
---|---|
bin | 1001011000110001000110… |
… | …01011100101001110100110 |
3 | 2201002101010121211022020000 |
4 | 10230120203023211032212 |
5 | 10201200212441010311 |
6 | 111522521442322130 |
7 | 4230231015005334 |
oct | 454304313451646 |
9 | 81071117738200 |
10 | 20642203063206 |
11 | 663934454066a |
12 | 2394720059346 |
13 | b6972255849a |
14 | 515133506b54 |
15 | 25be3ed10056 |
hex | 12c6232e53a6 |
20642203063206 has 20 divisors (see below), whose sum is σ = 46253825382732. Its totient is φ = 6880734354348.
The previous prime is 20642203063199. The next prime is 20642203063213. The reversal of 20642203063206 is 60236030224602.
20642203063206 is a `hidden beast` number, since 2 + 0 + 6 + 4 + 2 + 20 + 306 + 320 + 6 = 666.
It is an interprime number because it is at equal distance from previous prime (20642203063199) and next prime (20642203063213).
It is a super-2 number, since 2×206422030632062 (a number of 27 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 9 ways as a sum of consecutive naturals, for example, 63710503120 + ... + 63710503443.
Almost surely, 220642203063206 is an apocalyptic number.
20642203063206 is an abundant number, since it is smaller than the sum of its proper divisors (25611622319526).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20642203063206 is a wasteful number, since it uses less digits than its factorization.
20642203063206 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127421006577 (or 127421006568 counting only the distinct ones).
The product of its (nonzero) digits is 124416, while the sum is 36.
Adding to 20642203063206 its reverse (60236030224602), we get a palindrome (80878233287808).
The spelling of 20642203063206 in words is "twenty trillion, six hundred forty-two billion, two hundred three million, sixty-three thousand, two hundred six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •