Base | Representation |
---|---|
bin | 1011000110010000110011… |
… | …1111101001101000111101 |
3 | 1121012112001200212120011121 |
4 | 2301210030333221220331 |
5 | 3044410121321201112 |
6 | 41541342244350541 |
7 | 2366403250342513 |
oct | 261441477515075 |
9 | 47175050776147 |
10 | 12202220100157 |
11 | 3984a2915411a |
12 | 1450a569a5451 |
13 | 6a688395a299 |
14 | 30283a8904b3 |
15 | 16261b232407 |
hex | b190cfe9a3d |
12202220100157 has 2 divisors, whose sum is σ = 12202220100158. Its totient is φ = 12202220100156.
The previous prime is 12202220100107. The next prime is 12202220100197. The reversal of 12202220100157 is 75100102220221.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9919640006116 + 2282580094041 = 3149546^2 + 1510821^2 .
It is a cyclic number.
It is not a de Polignac number, because 12202220100157 - 243 = 3406127077949 is a prime.
It is a super-2 number, since 2×122022201001572 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (12202220100107) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 6101110050078 + 6101110050079.
It is an arithmetic number, because the mean of its divisors is an integer number (6101110050079).
Almost surely, 212202220100157 is an apocalyptic number.
It is an amenable number.
12202220100157 is a deficient number, since it is larger than the sum of its proper divisors (1).
12202220100157 is an equidigital number, since it uses as much as digits as its factorization.
12202220100157 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1120, while the sum is 25.
Adding to 12202220100157 its reverse (75100102220221), we get a palindrome (87302322320378).
The spelling of 12202220100157 in words is "twelve trillion, two hundred two billion, two hundred twenty million, one hundred thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •