Base | Representation |
---|---|
bin | 1011000110010000101111… |
… | …1011011000000001101001 |
3 | 1121012112000110012020210221 |
4 | 2301210023323120001221 |
5 | 3044410102230432332 |
6 | 41541340405010041 |
7 | 2366402642250106 |
oct | 261441373300151 |
9 | 47175013166727 |
10 | 12202202202217 |
11 | 3984a1a03a135 |
12 | 1450a509b3921 |
13 | 6a68800318a1 |
14 | 302838351aad |
15 | 162619899297 |
hex | b190bed8069 |
12202202202217 has 2 divisors, whose sum is σ = 12202202202218. Its totient is φ = 12202202202216.
The previous prime is 12202202202181. The next prime is 12202202202251. The reversal of 12202202202217 is 71220220220221.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7099554921001 + 5102647281216 = 2664499^2 + 2258904^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12202202202217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 12202202202191 and 12202202202200.
It is not a weakly prime, because it can be changed into another prime (12202202200217) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101101101108 + 6101101101109.
It is an arithmetic number, because the mean of its divisors is an integer number (6101101101109).
Almost surely, 212202202202217 is an apocalyptic number.
It is an amenable number.
12202202202217 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202202202217 is an equidigital number, since it uses as much as digits as its factorization.
12202202202217 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1792, while the sum is 25.
Adding to 12202202202217 its reverse (71220220220221), we get a palindrome (83422422422438).
The spelling of 12202202202217 in words is "twelve trillion, two hundred two billion, two hundred two million, two hundred two thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •