Base | Representation |
---|---|
bin | 100000000010110010000… |
… | …101110011000111111001 |
3 | 21210111202221102000121220 |
4 | 200002302011303013321 |
5 | 242034204321320441 |
6 | 4403331232222253 |
7 | 315042613460031 |
oct | 40026205630771 |
9 | 7714687360556 |
10 | 2202011120121 |
11 | 77995a96432a |
12 | 2b692109a989 |
13 | 12c858422247 |
14 | 78813ac28c1 |
15 | 3c42ccae466 |
hex | 200b21731f9 |
2202011120121 has 4 divisors (see below), whose sum is σ = 2936014826832. Its totient is φ = 1468007413412.
The previous prime is 2202011120083. The next prime is 2202011120161. The reversal of 2202011120121 is 1210211102022.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 2202011120121 - 27 = 2202011119993 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2202011120121.
It is not an unprimeable number, because it can be changed into a prime (2202011120161) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 367001853351 + ... + 367001853356.
It is an arithmetic number, because the mean of its divisors is an integer number (734003706708).
Almost surely, 22202011120121 is an apocalyptic number.
It is an amenable number.
2202011120121 is a deficient number, since it is larger than the sum of its proper divisors (734003706711).
2202011120121 is an equidigital number, since it uses as much as digits as its factorization.
2202011120121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 734003706710.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 2202011120121 its reverse (1210211102022), we get a palindrome (3412222222143).
The spelling of 2202011120121 in words is "two trillion, two hundred two billion, eleven million, one hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •