Base | Representation |
---|---|
bin | 1001001100100000111011… |
… | …00000111101101100010011 |
3 | 2122121010110021120020221000 |
4 | 10212100131200331230103 |
5 | 10122301010002211011 |
6 | 111001254103433043 |
7 | 4154635134211065 |
oct | 446203540755423 |
9 | 78533407506830 |
10 | 20221201210131 |
11 | 6496843a101a9 |
12 | 2327007455783 |
13 | b38b0ab06a5c |
14 | 4dc9d5d8b735 |
15 | 250eee750356 |
hex | 12641d83db13 |
20221201210131 has 32 divisors (see below), whose sum is σ = 30295143201600. Its totient is φ = 13328799264000.
The previous prime is 20221201210117. The next prime is 20221201210201. The reversal of 20221201210131 is 13101210212202.
20221201210131 is a `hidden beast` number, since 2 + 0 + 221 + 201 + 210 + 1 + 31 = 666.
It is not a de Polignac number, because 20221201210131 - 219 = 20221200685843 is a prime.
It is a super-2 number, since 2×202212012101312 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (20221201260131) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 65392381 + ... + 65700881.
It is an arithmetic number, because the mean of its divisors is an integer number (946723225050).
Almost surely, 220221201210131 is an apocalyptic number.
20221201210131 is a deficient number, since it is larger than the sum of its proper divisors (10073941991469).
20221201210131 is a wasteful number, since it uses less digits than its factorization.
20221201210131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 335876 (or 335870 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 20221201210131 its reverse (13101210212202), we get a palindrome (33322411422333).
The spelling of 20221201210131 in words is "twenty trillion, two hundred twenty-one billion, two hundred one million, two hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •