Base | Representation |
---|---|
bin | 11011110000111101110111… |
… | …000101001001101110111011 |
3 | 121000100210222002020112021211 |
4 | 123300331313011021232323 |
5 | 112001141303014004432 |
6 | 1111413324244343551 |
7 | 34502213321546512 |
oct | 3360756705115673 |
9 | 530323862215254 |
10 | 122112213031867 |
11 | 359aa553885763 |
12 | 118421b90a4bb7 |
13 | 531a194803146 |
14 | 22223969b3679 |
15 | e1b643b6dd47 |
hex | 6f0f77149bbb |
122112213031867 has 2 divisors, whose sum is σ = 122112213031868. Its totient is φ = 122112213031866.
The previous prime is 122112213031841. The next prime is 122112213031901. The reversal of 122112213031867 is 768130312211221.
It is a happy number.
It is a weak prime.
It is an emirp because it is prime and its reverse (768130312211221) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 122112213031867 - 215 = 122112212999099 is a prime.
It is a super-2 number, since 2×1221122130318672 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122112213031807) 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, 61056106515933 + 61056106515934.
It is an arithmetic number, because the mean of its divisors is an integer number (61056106515934).
Almost surely, 2122112213031867 is an apocalyptic number.
122112213031867 is a deficient number, since it is larger than the sum of its proper divisors (1).
122112213031867 is an equidigital number, since it uses as much as digits as its factorization.
122112213031867 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48384, while the sum is 40.
The spelling of 122112213031867 in words is "one hundred twenty-two trillion, one hundred twelve billion, two hundred thirteen million, thirty-one thousand, eight hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •