Base | Representation |
---|---|
bin | 11011101111010111011001… |
… | …110111000000110111010011 |
3 | 120222222022000011102101012022 |
4 | 123233113121313000313103 |
5 | 111442341001441321321 |
6 | 1111251012031322055 |
7 | 34461240163665266 |
oct | 3357273167006723 |
9 | 528868004371168 |
10 | 122002201120211 |
11 | 3596792aa3a205 |
12 | 11824a1638032b |
13 | 530c9b19c5529 |
14 | 221ad1bdaccdd |
15 | e188559c1dab |
hex | 6ef5d9dc0dd3 |
122002201120211 has 2 divisors, whose sum is σ = 122002201120212. Its totient is φ = 122002201120210.
The previous prime is 122002201120193. The next prime is 122002201120271. The reversal of 122002201120211 is 112021102200221.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-122002201120211 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 122002201120211.
It is not a weakly prime, because it can be changed into another prime (122002201120271) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61001100560105 + 61001100560106.
It is an arithmetic number, because the mean of its divisors is an integer number (61001100560106).
Almost surely, 2122002201120211 is an apocalyptic number.
122002201120211 is a deficient number, since it is larger than the sum of its proper divisors (1).
122002201120211 is an equidigital number, since it uses as much as digits as its factorization.
122002201120211 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 122002201120211 its reverse (112021102200221), we get a palindrome (234023303320432).
The spelling of 122002201120211 in words is "one hundred twenty-two trillion, two billion, two hundred one million, one hundred twenty thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •