Base | Representation |
---|---|
bin | 1011000110010000110010… |
… | …0101110010010111000011 |
3 | 1121012112001020010002201112 |
4 | 2301210030211302113003 |
5 | 3044410113102221011 |
6 | 41541341443153535 |
7 | 2366403135613622 |
oct | 261441445622703 |
9 | 47175036102645 |
10 | 12202213320131 |
11 | 3984a2534319a |
12 | 1450a546758ab |
13 | 6a6882425233 |
14 | 302839a076b9 |
15 | 16261a84358b |
hex | b190c9725c3 |
12202213320131 has 2 divisors, whose sum is σ = 12202213320132. Its totient is φ = 12202213320130.
The previous prime is 12202213320079. The next prime is 12202213320133. The reversal of 12202213320131 is 13102331220221.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 12202213320131 - 218 = 12202213057987 is a prime.
It is a super-2 number, since 2×122022133201312 (a number of 27 digits) contains 22 as substring.
Together with 12202213320133, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 12202213320097 and 12202213320106.
It is not a weakly prime, because it can be changed into another prime (12202213320133) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101106660065 + 6101106660066.
It is an arithmetic number, because the mean of its divisors is an integer number (6101106660066).
Almost surely, 212202213320131 is an apocalyptic number.
12202213320131 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202213320131 is an equidigital number, since it uses as much as digits as its factorization.
12202213320131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 12202213320131 its reverse (13102331220221), we get a palindrome (25304544540352).
The spelling of 12202213320131 in words is "twelve trillion, two hundred two billion, two hundred thirteen million, three hundred twenty thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •