Base | Representation |
---|---|
bin | 1011000110010000101111… |
… | …0111001111111000000101 |
3 | 1121012112000101011021122111 |
4 | 2301210023313033320011 |
5 | 3044410101441322021 |
6 | 41541340325501021 |
7 | 2366402630122525 |
oct | 261441367177005 |
9 | 47175011137574 |
10 | 12202201120261 |
11 | 3984a19470259 |
12 | 1450a50571771 |
13 | 6a687ca43289 |
14 | 30283814d685 |
15 | 1626197338e1 |
hex | b190bdcfe05 |
12202201120261 has 2 divisors, whose sum is σ = 12202201120262. Its totient is φ = 12202201120260.
The previous prime is 12202201120181. The next prime is 12202201120303. The reversal of 12202201120261 is 16202110220221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10983881869636 + 1218319250625 = 3314194^2 + 1103775^2 .
It is a cyclic number.
It is not a de Polignac number, because 12202201120261 - 211 = 12202201118213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12202201121261) 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, 6101100560130 + 6101100560131.
It is an arithmetic number, because the mean of its divisors is an integer number (6101100560131).
Almost surely, 212202201120261 is an apocalyptic number.
It is an amenable number.
12202201120261 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202201120261 is an equidigital number, since it uses as much as digits as its factorization.
12202201120261 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 384, while the sum is 22.
Adding to 12202201120261 its reverse (16202110220221), we get a palindrome (28404311340482).
The spelling of 12202201120261 in words is "twelve trillion, two hundred two billion, two hundred one million, one hundred twenty thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.168 sec. • engine limits •