Base | Representation |
---|---|
bin | 1001001100100000110001… |
… | …01011101000100101111011 |
3 | 2122121010020121222111211200 |
4 | 10212100120223220211323 |
5 | 10122300323222334321 |
6 | 111001242045425243 |
7 | 4154633131031202 |
oct | 446203053504573 |
9 | 78533217874750 |
10 | 20221120121211 |
11 | 6496802165969 |
12 | 2326ba426b223 |
13 | b38ac7084b49 |
14 | 4dc9c92c0239 |
15 | 250ee7583d26 |
hex | 126418ae897b |
20221120121211 has 48 divisors (see below), whose sum is σ = 29631863843712. Its totient is φ = 13286495232000.
The previous prime is 20221120121207. The next prime is 20221120121227. The reversal of 20221120121211 is 11212102112202.
20221120121211 is a `hidden beast` number, since 20 + 2 + 211 + 201 + 21 + 211 = 666.
It is not a de Polignac number, because 20221120121211 - 22 = 20221120121207 is a prime.
It is a super-5 number, since 5×202211201212115 (a number of 68 digits) contains 55555 as substring.
It is not an unprimeable number, because it can be changed into a prime (20221120128211) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 989717166 + ... + 989737596.
It is an arithmetic number, because the mean of its divisors is an integer number (617330496744).
Almost surely, 220221120121211 is an apocalyptic number.
20221120121211 is a deficient number, since it is larger than the sum of its proper divisors (9410743722501).
20221120121211 is a wasteful number, since it uses less digits than its factorization.
20221120121211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25444 (or 25441 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 20221120121211 its reverse (11212102112202), we get a palindrome (31433222233413).
The spelling of 20221120121211 in words is "twenty trillion, two hundred twenty-one billion, one hundred twenty million, one hundred twenty-one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •