Base | Representation |
---|---|
bin | 1001001001101000100001… |
… | …11010101110001011010111 |
3 | 2122020122221002212202020210 |
4 | 10210310100322232023113 |
5 | 10114140234114020321 |
6 | 110444002540300503 |
7 | 4144532004412131 |
oct | 444642072561327 |
9 | 78218832782223 |
10 | 20122205610711 |
11 | 6458863534126 |
12 | 230b999b41733 |
13 | b2c6924154a9 |
14 | 4d7cc44a2051 |
15 | 24d6587b5b76 |
hex | 124d10eae2d7 |
20122205610711 has 8 divisors (see below), whose sum is σ = 26842574916720. Its totient is φ = 13408320022592.
The previous prime is 20122205610677. The next prime is 20122205610713. The reversal of 20122205610711 is 11701650222102.
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 20122205610711 - 211 = 20122205608663 is a prime.
It is a super-3 number, since 3×201222056107113 (a number of 41 digits) contains 333 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20122205610713) 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, 1620922230 + ... + 1620934643.
It is an arithmetic number, because the mean of its divisors is an integer number (3355321864590).
Almost surely, 220122205610711 is an apocalyptic number.
20122205610711 is a deficient number, since it is larger than the sum of its proper divisors (6720369306009).
20122205610711 is a wasteful number, since it uses less digits than its factorization.
20122205610711 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3241858945.
The product of its (nonzero) digits is 3360, while the sum is 30.
Adding to 20122205610711 its reverse (11701650222102), we get a palindrome (31823855832813).
The spelling of 20122205610711 in words is "twenty trillion, one hundred twenty-two billion, two hundred five million, six hundred ten thousand, seven hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •