Base | Representation |
---|---|
bin | 101101111110101101111011… |
… | …001100010001001001110001 |
3 | 222112000020100201020121200001 |
4 | 231332231323030101021301 |
5 | 203001201140033323441 |
6 | 1554031302042230001 |
7 | 60411025654632244 |
oct | 5576557314211161 |
9 | 875006321217601 |
10 | 202222012011121 |
11 | 59485967955063 |
12 | 1a81bb927b5301 |
13 | 88ab5b930b46b |
14 | 37d1851b8125b |
15 | 185a3d2be3731 |
hex | b7eb7b311271 |
202222012011121 has 8 divisors (see below), whose sum is σ = 212931983880000. Its totient is φ = 191518710950160.
The previous prime is 202222012011109. The next prime is 202222012011127. The reversal of 202222012011121 is 121110210222202.
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 202222012011121 - 29 = 202222012010609 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is not an unprimeable number, because it can be changed into a prime (202222012011127) 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, 1667639746 + ... + 1667761003.
It is an arithmetic number, because the mean of its divisors is an integer number (26616497985000).
Almost surely, 2202222012011121 is an apocalyptic number.
It is an amenable number.
202222012011121 is a deficient number, since it is larger than the sum of its proper divisors (10709971868879).
202222012011121 is a wasteful number, since it uses less digits than its factorization.
202222012011121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3335403959.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 202222012011121 its reverse (121110210222202), we get a palindrome (323332222233323).
The spelling of 202222012011121 in words is "two hundred two trillion, two hundred twenty-two billion, twelve million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •