Base | Representation |
---|---|
bin | 111101100100011111… |
… | …1111011010101111101 |
3 | 110122021201112220221102 |
4 | 1323020333323111331 |
5 | 4131242113021341 |
6 | 140424103342445 |
7 | 12360364554026 |
oct | 1731077732575 |
9 | 418251486842 |
10 | 132221220221 |
11 | 51090482822 |
12 | 21760751a25 |
13 | c612125b1c |
14 | 65844abc4d |
15 | 368cd72c9b |
hex | 1ec8ffb57d |
132221220221 has 2 divisors, whose sum is σ = 132221220222. Its totient is φ = 132221220220.
The previous prime is 132221220217. The next prime is 132221220223. The reversal of 132221220221 is 122022122231.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70761852121 + 61459368100 = 266011^2 + 247910^2 .
It is a cyclic number.
It is not a de Polignac number, because 132221220221 - 22 = 132221220217 is a prime.
Together with 132221220223, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 132221220193 and 132221220202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (132221220223) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 66110610110 + 66110610111.
It is an arithmetic number, because the mean of its divisors is an integer number (66110610111).
Almost surely, 2132221220221 is an apocalyptic number.
It is an amenable number.
132221220221 is a deficient number, since it is larger than the sum of its proper divisors (1).
132221220221 is an equidigital number, since it uses as much as digits as its factorization.
132221220221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 384, while the sum is 20.
Adding to 132221220221 its reverse (122022122231), we get a palindrome (254243342452).
The spelling of 132221220221 in words is "one hundred thirty-two billion, two hundred twenty-one million, two hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •