Base | Representation |
---|---|
bin | 111000111010001001… |
… | …0111010101001011001 |
3 | 102200110001001102010101 |
4 | 1301310102322221121 |
5 | 4000241302401103 |
6 | 132050444415401 |
7 | 11554324363426 |
oct | 1616422725131 |
9 | 380401042111 |
10 | 122210200153 |
11 | 47913521218 |
12 | 1b827b47561 |
13 | b6a807a702 |
14 | 5cb4abad4d |
15 | 32a4039a1d |
hex | 1c744baa59 |
122210200153 has 2 divisors, whose sum is σ = 122210200154. Its totient is φ = 122210200152.
The previous prime is 122210200093. The next prime is 122210200183. The reversal of 122210200153 is 351002012221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 92904868809 + 29305331344 = 304803^2 + 171188^2 .
It is a cyclic number.
It is not a de Polignac number, because 122210200153 - 229 = 121673329241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122210200153.
It is not a weakly prime, because it can be changed into another prime (122210200183) 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 as a sum of consecutive naturals, namely, 61105100076 + 61105100077.
It is an arithmetic number, because the mean of its divisors is an integer number (61105100077).
Almost surely, 2122210200153 is an apocalyptic number.
It is an amenable number.
122210200153 is a deficient number, since it is larger than the sum of its proper divisors (1).
122210200153 is an equidigital number, since it uses as much as digits as its factorization.
122210200153 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 240, while the sum is 19.
Adding to 122210200153 its reverse (351002012221), we get a palindrome (473212212374).
The spelling of 122210200153 in words is "one hundred twenty-two billion, two hundred ten million, two hundred thousand, one hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •