Base | Representation |
---|---|
bin | 10001110001001010100… |
… | …110001001011011010011 |
3 | 11022201200010201211212021 |
4 | 101301022212021123103 |
5 | 130001123142214011 |
6 | 2332532503512311 |
7 | 154134032451031 |
oct | 21611246113323 |
9 | 4281603654767 |
10 | 1221022226131 |
11 | 43091823a7a4 |
12 | 178785a58697 |
13 | 8b1ac9b2276 |
14 | 431524a5551 |
15 | 21b65578471 |
hex | 11c4a9896d3 |
1221022226131 has 2 divisors, whose sum is σ = 1221022226132. Its totient is φ = 1221022226130.
The previous prime is 1221022226117. The next prime is 1221022226173. The reversal of 1221022226131 is 1316222201221.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1221022226131 is a prime.
It is a super-2 number, since 2×12210222261312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1221022226096 and 1221022226105.
It is not a weakly prime, because it can be changed into another prime (1221022226101) 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, 610511113065 + 610511113066.
It is an arithmetic number, because the mean of its divisors is an integer number (610511113066).
Almost surely, 21221022226131 is an apocalyptic number.
1221022226131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1221022226131 is an equidigital number, since it uses as much as digits as its factorization.
1221022226131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1152, while the sum is 25.
Adding to 1221022226131 its reverse (1316222201221), we get a palindrome (2537244427352).
The spelling of 1221022226131 in words is "one trillion, two hundred twenty-one billion, twenty-two million, two hundred twenty-six thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •