Base | Representation |
---|---|
bin | 111000111010001001… |
… | …0111010101000111001 |
3 | 102200110001001102002012 |
4 | 1301310102322220321 |
5 | 4000241302400441 |
6 | 132050444415305 |
7 | 11554324363352 |
oct | 1616422725071 |
9 | 380401042065 |
10 | 122210200121 |
11 | 47913521199 |
12 | 1b827b47535 |
13 | b6a807a6a9 |
14 | 5cb4abad29 |
15 | 32a40399eb |
hex | 1c744baa39 |
122210200121 has 16 divisors (see below), whose sum is σ = 124770336768. Its totient is φ = 119683434000.
The previous prime is 122210200093. The next prime is 122210200153. The reversal of 122210200121 is 121002012221.
It is a de Polignac number, because none of the positive numbers 2k-122210200121 is a prime.
It is a super-2 number, since 2×1222102001212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 122210200096 and 122210200105.
It is not an unprimeable number, because it can be changed into a prime (122210290121) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3669896 + ... + 3703046.
It is an arithmetic number, because the mean of its divisors is an integer number (7798146048).
Almost surely, 2122210200121 is an apocalyptic number.
It is an amenable number.
122210200121 is a deficient number, since it is larger than the sum of its proper divisors (2560136647).
122210200121 is a wasteful number, since it uses less digits than its factorization.
122210200121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33652.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 122210200121 its reverse (121002012221), we get a palindrome (243212212342).
The spelling of 122210200121 in words is "one hundred twenty-two billion, two hundred ten million, two hundred thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •