Base | Representation |
---|---|
bin | 1001000110001110101000… |
… | …01001110000111000001001 |
3 | 2121211110222022121221200022 |
4 | 10203013110021300320021 |
5 | 10110231143314324021 |
6 | 110314134440150225 |
7 | 4133221023353456 |
oct | 443072411607011 |
9 | 77743868557608 |
10 | 20005222026761 |
11 | 6413192332034 |
12 | 22b1190468375 |
13 | b2163b13c6ba |
14 | 4d23879d682d |
15 | 24a5ad5481ab |
hex | 1231d4270e09 |
20005222026761 has 8 divisors (see below), whose sum is σ = 20031471561024. Its totient is φ = 19978976391120.
The previous prime is 20005222026739. The next prime is 20005222026799. The reversal of 20005222026761 is 16762022250002.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 20005222026761 - 226 = 20005154917897 is a prime.
It is a super-2 number, since 2×200052220267612 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (20005222026731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 9366695 + ... + 11302451.
It is an arithmetic number, because the mean of its divisors is an integer number (2503933945128).
Almost surely, 220005222026761 is an apocalyptic number.
It is an amenable number.
20005222026761 is a deficient number, since it is larger than the sum of its proper divisors (26249534263).
20005222026761 is a wasteful number, since it uses less digits than its factorization.
20005222026761 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1949311.
The product of its (nonzero) digits is 40320, while the sum is 35.
Adding to 20005222026761 its reverse (16762022250002), we get a palindrome (36767244276763).
The spelling of 20005222026761 in words is "twenty trillion, five billion, two hundred twenty-two million, twenty-six thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.103 sec. • engine limits •