Base | Representation |
---|---|
bin | 10001110011001101101… |
… | …110000101101001111011 |
3 | 11022221100110020012012221 |
4 | 101303031232011221323 |
5 | 130020124330420011 |
6 | 2333535051144511 |
7 | 154242404330641 |
oct | 21631556055173 |
9 | 4287313205187 |
10 | 1223222123131 |
11 | 431846aa9998 |
12 | 17909a745137 |
13 | 8b4706a8a78 |
14 | 432c0717191 |
15 | 21c43774971 |
hex | 11ccdb85a7b |
1223222123131 has 2 divisors, whose sum is σ = 1223222123132. Its totient is φ = 1223222123130.
The previous prime is 1223222123069. The next prime is 1223222123141. The reversal of 1223222123131 is 1313212223221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1223222123131 - 231 = 1221074639483 is a prime.
It is a super-2 number, since 2×12232221231312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1223222123096 and 1223222123105.
It is not a weakly prime, because it can be changed into another prime (1223222123141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 611611061565 + 611611061566.
It is an arithmetic number, because the mean of its divisors is an integer number (611611061566).
Almost surely, 21223222123131 is an apocalyptic number.
1223222123131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1223222123131 is an equidigital number, since it uses as much as digits as its factorization.
1223222123131 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1728, while the sum is 25.
Adding to 1223222123131 its reverse (1313212223221), we get a palindrome (2536434346352).
The spelling of 1223222123131 in words is "one trillion, two hundred twenty-three billion, two hundred twenty-two million, one hundred twenty-three thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •