Base | Representation |
---|---|
bin | 1001001001010100001101… |
… | …11101101110111110100110 |
3 | 2122012121210011022210121121 |
4 | 10210222012331232332212 |
5 | 10114000421102210042 |
6 | 110435000525204154 |
7 | 4143664535502361 |
oct | 444520675567646 |
9 | 78177704283547 |
10 | 20111301210022 |
11 | 6454178261530 |
12 | 230985610065a |
13 | b2b6452505a9 |
14 | 4d756c1990d8 |
15 | 24d21b30c367 |
hex | 124a86f6efa6 |
20111301210022 has 16 divisors (see below), whose sum is σ = 32997630953232. Its totient is φ = 9116992501920.
The previous prime is 20111301210019. The next prime is 20111301210023. The reversal of 20111301210022 is 22001210311102.
It is a super-2 number, since 2×201113012100222 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20111301209978 and 20111301210005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (20111301210023) 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, 1225394013 + ... + 1225410424.
It is an arithmetic number, because the mean of its divisors is an integer number (2062351934577).
Almost surely, 220111301210022 is an apocalyptic number.
20111301210022 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
20111301210022 is a deficient number, since it is larger than the sum of its proper divisors (12886329743210).
20111301210022 is a wasteful number, since it uses less digits than its factorization.
20111301210022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2450804823.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 20111301210022 its reverse (22001210311102), we get a palindrome (42112511521124).
The spelling of 20111301210022 in words is "twenty trillion, one hundred eleven billion, three hundred one million, two hundred ten thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •