Base | Representation |
---|---|
bin | 11011110000110101011110… |
… | …100001111011100101111011 |
3 | 121000022221201201201122200211 |
4 | 123300311132201323211323 |
5 | 112001014334032224011 |
6 | 1111405235120211551 |
7 | 34501444254413263 |
oct | 3360653641734573 |
9 | 530287651648624 |
10 | 122103211211131 |
11 | 359a6754560597 |
12 | 11840506469bb7 |
13 | 531938b8661b7 |
14 | 2221b812467a3 |
15 | e1b2b8732b21 |
hex | 6f0d5e87b97b |
122103211211131 has 2 divisors, whose sum is σ = 122103211211132. Its totient is φ = 122103211211130.
The previous prime is 122103211211089. The next prime is 122103211211143. The reversal of 122103211211131 is 131112112301221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 122103211211131 - 215 = 122103211178363 is a prime.
It is a super-2 number, since 2×1221032112111312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (122103211211161) 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, 61051605605565 + 61051605605566.
It is an arithmetic number, because the mean of its divisors is an integer number (61051605605566).
Almost surely, 2122103211211131 is an apocalyptic number.
122103211211131 is a deficient number, since it is larger than the sum of its proper divisors (1).
122103211211131 is an equidigital number, since it uses as much as digits as its factorization.
122103211211131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 122103211211131 its reverse (131112112301221), we get a palindrome (253215323512352).
The spelling of 122103211211131 in words is "one hundred twenty-two trillion, one hundred three billion, two hundred eleven million, two hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.098 sec. • engine limits •