Base | Representation |
---|---|
bin | 1001001100100010011011… |
… | …01111000011101100110001 |
3 | 2122121012112122211202122122 |
4 | 10212101031233003230301 |
5 | 10122304134103223441 |
6 | 111001510243244025 |
7 | 4154664156463415 |
oct | 446211557035461 |
9 | 78535478752578 |
10 | 20222010211121 |
11 | 6497119639664 |
12 | 23271b2379615 |
13 | b38c095bb874 |
14 | 4dca715bad45 |
15 | 25104a7a434b |
hex | 12644dbc3b31 |
20222010211121 has 8 divisors (see below), whose sum is σ = 20478781699200. Its totient is φ = 19965258640080.
The previous prime is 20222010211103. The next prime is 20222010211133. The reversal of 20222010211121 is 12111201022202.
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 20222010211121 - 210 = 20222010210097 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 20222010211121.
It is not an unprimeable number, because it can be changed into a prime (20222010211181) 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, 2930426 + ... + 7002243.
It is an arithmetic number, because the mean of its divisors is an integer number (2559847712400).
Almost surely, 220222010211121 is an apocalyptic number.
It is an amenable number.
20222010211121 is a deficient number, since it is larger than the sum of its proper divisors (256771488079).
20222010211121 is an equidigital number, since it uses as much as digits as its factorization.
20222010211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9958519.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 20222010211121 its reverse (12111201022202), we get a palindrome (32333211233323).
The spelling of 20222010211121 in words is "twenty trillion, two hundred twenty-two billion, ten million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •