Base | Representation |
---|---|
bin | 1001001100100000110001… |
… | …01011111110110010100011 |
3 | 2122121010020122011010120002 |
4 | 10212100120223332302203 |
5 | 10122300323233242011 |
6 | 111001242051410215 |
7 | 4154633131560236 |
oct | 446203053766243 |
9 | 78533218133502 |
10 | 20221120212131 |
11 | 6496802218203 |
12 | 2326ba42b396b |
13 | b38ac70b7347 |
14 | 4dc9c930541d |
15 | 250ee75a0c3b |
hex | 126418afeca3 |
20221120212131 has 8 divisors (see below), whose sum is σ = 21554825011200. Its totient is φ = 18914358944520.
The previous prime is 20221120212101. The next prime is 20221120212143. The reversal of 20221120212131 is 13121202112202.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-20221120212131 is a prime.
It is a super-2 number, since 2×202211202121312 (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 (20221120212101) 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, 6735881315 + ... + 6735884316.
It is an arithmetic number, because the mean of its divisors is an integer number (2694353126400).
Almost surely, 220221120212131 is an apocalyptic number.
20221120212131 is a deficient number, since it is larger than the sum of its proper divisors (1333704799069).
20221120212131 is a wasteful number, since it uses less digits than its factorization.
20221120212131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 13471765729.
The product of its (nonzero) digits is 192, while the sum is 20.
Adding to 20221120212131 its reverse (13121202112202), we get a palindrome (33342322324333).
The spelling of 20221120212131 in words is "twenty trillion, two hundred twenty-one billion, one hundred twenty million, two hundred twelve thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •