Base | Representation |
---|---|
bin | 1001000110101110000101… |
… | …10100100010101011111001 |
3 | 2121220002120100102210021121 |
4 | 10203113002310202223321 |
5 | 10111020240421320441 |
6 | 110330010400105241 |
7 | 4134356402315635 |
oct | 443270264425371 |
9 | 77802510383247 |
10 | 20022111120121 |
11 | 641a36982a930 |
12 | 22b4504605221 |
13 | b23100170b76 |
14 | 4d310aa85dc5 |
15 | 24ac4b113dd1 |
hex | 1235c2d22af9 |
20022111120121 has 8 divisors (see below), whose sum is σ = 21845220493824. Its totient is φ = 18199487988720.
The previous prime is 20022111120119. The next prime is 20022111120149. The reversal of 20022111120121 is 12102111122002.
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 20022111120121 - 21 = 20022111120119 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 20022111120095 and 20022111120104.
It is not an unprimeable number, because it can be changed into a prime (20022111120521) 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, 121474470 + ... + 121639183.
It is an arithmetic number, because the mean of its divisors is an integer number (2730652561728).
Almost surely, 220022111120121 is an apocalyptic number.
It is an amenable number.
20022111120121 is a deficient number, since it is larger than the sum of its proper divisors (1823109373703).
20022111120121 is a wasteful number, since it uses less digits than its factorization.
20022111120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 243121151.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 20022111120121 its reverse (12102111122002), we get a palindrome (32124222242123).
The spelling of 20022111120121 in words is "twenty trillion, twenty-two billion, one hundred eleven million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •