Base | Representation |
---|---|
bin | 110010000001101111100100… |
… | …011000000111110111100001 |
3 | 1001212000220112221001000101101 |
4 | 302001233210120013313201 |
5 | 212314320301011413441 |
6 | 2055540433405434401 |
7 | 64226034162421231 |
oct | 6201574430076741 |
9 | 1055026487030341 |
10 | 220022121201121 |
11 | 641189484a9188 |
12 | 2081591726ba01 |
13 | 959ccc654c425 |
14 | 3c491adb71cc1 |
15 | 1a68430ee5231 |
hex | c81be4607de1 |
220022121201121 has 12 divisors (see below), whose sum is σ = 233787770914320. Its totient is φ = 207024844984640.
The previous prime is 220022121201073. The next prime is 220022121201143. The reversal of 220022121201121 is 121102121220022.
It is not a de Polignac number, because 220022121201121 - 27 = 220022121200993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (220022121201191) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 99638515 + ... + 101822776.
It is an arithmetic number, because the mean of its divisors is an integer number (19482314242860).
Almost surely, 2220022121201121 is an apocalyptic number.
It is an amenable number.
220022121201121 is a deficient number, since it is larger than the sum of its proper divisors (13765649713199).
220022121201121 is a wasteful number, since it uses less digits than its factorization.
220022121201121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 201465104 (or 201465087 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 220022121201121 its reverse (121102121220022), we get a palindrome (341124242421143).
The spelling of 220022121201121 in words is "two hundred twenty trillion, twenty-two billion, one hundred twenty-one million, two hundred one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •