Base | Representation |
---|---|
bin | 10001100111000110110… |
… | …110101000110111110011 |
3 | 11021200210110020122012201 |
4 | 101213012312220313303 |
5 | 124312013314202011 |
6 | 2323545054004031 |
7 | 153302300312563 |
oct | 21470666506763 |
9 | 4250713218181 |
10 | 1210222022131 |
11 | 427285865671 |
12 | 176670aa6617 |
13 | 8a17b2a0105 |
14 | 42809d62da3 |
15 | 21732302cc1 |
hex | 119c6da8df3 |
1210222022131 has 2 divisors, whose sum is σ = 1210222022132. Its totient is φ = 1210222022130.
The previous prime is 1210222022083. The next prime is 1210222022153. The reversal of 1210222022131 is 1312202220121.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1210222022131 - 27 = 1210222022003 is a prime.
It is a super-2 number, since 2×12102220221312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1210222022099 and 1210222022108.
It is not a weakly prime, because it can be changed into another prime (1210222022731) 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, 605111011065 + 605111011066.
It is an arithmetic number, because the mean of its divisors is an integer number (605111011066).
Almost surely, 21210222022131 is an apocalyptic number.
1210222022131 is a deficient number, since it is larger than the sum of its proper divisors (1).
1210222022131 is an equidigital number, since it uses as much as digits as its factorization.
1210222022131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 1210222022131 its reverse (1312202220121), we get a palindrome (2522424242252).
The spelling of 1210222022131 in words is "one trillion, two hundred ten billion, two hundred twenty-two million, twenty-two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.282 sec. • engine limits •