Base | Representation |
---|---|
bin | 110010000100100000100000… |
… | …000100110001100111011101 |
3 | 1001212201001220222011011102012 |
4 | 302010200200010301213131 |
5 | 212330423340414320404 |
6 | 2100204013123041005 |
7 | 64245541105003241 |
oct | 6204404004614735 |
9 | 1055631828134365 |
10 | 220212101323229 |
11 | 64191478308864 |
12 | 208466b7210165 |
13 | 95b4bb1a11472 |
14 | 3c544731d8421 |
15 | 1a6d34e981a6e |
hex | c848201319dd |
220212101323229 has 2 divisors, whose sum is σ = 220212101323230. Its totient is φ = 220212101323228.
The previous prime is 220212101323219. The next prime is 220212101323237. The reversal of 220212101323229 is 922323101212022.
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., 220195861644004 + 16239679225 = 14838998^2 + 127435^2 .
It is a cyclic number.
It is not a de Polignac number, because 220212101323229 - 240 = 219112589695453 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 220212101323195 and 220212101323204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220212101323219) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110106050661614 + 110106050661615.
It is an arithmetic number, because the mean of its divisors is an integer number (110106050661615).
Almost surely, 2220212101323229 is an apocalyptic number.
It is an amenable number.
220212101323229 is a deficient number, since it is larger than the sum of its proper divisors (1).
220212101323229 is an equidigital number, since it uses as much as digits as its factorization.
220212101323229 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10368, while the sum is 32.
The spelling of 220212101323229 in words is "two hundred twenty trillion, two hundred twelve billion, one hundred one million, three hundred twenty-three thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •