Base | Representation |
---|---|
bin | 1011000110010000101111… |
… | …1010101001011001000001 |
3 | 1121012112000102211112210021 |
4 | 2301210023322221121001 |
5 | 3044410102203324301 |
6 | 41541340400533441 |
7 | 2366402640523156 |
oct | 261441372513101 |
9 | 47175012745707 |
10 | 12202202011201 |
11 | 3984a19a19674 |
12 | 1450a50921281 |
13 | 6a687cc95967 |
14 | 30283830222d |
15 | 16261985c8a1 |
hex | b190bea9641 |
12202202011201 has 2 divisors, whose sum is σ = 12202202011202. Its totient is φ = 12202202011200.
The previous prime is 12202202011193. The next prime is 12202202011217. The reversal of 12202202011201 is 10211020220221.
It is a happy number.
It is an a-pointer prime, because the next prime (12202202011217) can be obtained adding 12202202011201 to its sum of digits (16).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7988542612801 + 4213659398400 = 2826401^2 + 2052720^2 .
It is a cyclic number.
It is not a de Polignac number, because 12202202011201 - 23 = 12202202011193 is a prime.
It is not a weakly prime, because it can be changed into another prime (12202202011261) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101101005600 + 6101101005601.
It is an arithmetic number, because the mean of its divisors is an integer number (6101101005601).
Almost surely, 212202202011201 is an apocalyptic number.
It is an amenable number.
12202202011201 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202202011201 is an equidigital number, since it uses as much as digits as its factorization.
12202202011201 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 12202202011201 its reverse (10211020220221), we get a palindrome (22413222231422).
The spelling of 12202202011201 in words is "twelve trillion, two hundred two billion, two hundred two million, eleven thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •