Base | Representation |
---|---|
bin | 1100111001100100011… |
… | …1111111101100100101 |
3 | 210012000112201102020111 |
4 | 3032121013333230211 |
5 | 12112330224421203 |
6 | 245450213333021 |
7 | 22003521553414 |
oct | 3163107775445 |
9 | 705015642214 |
10 | 221612342053 |
11 | 85a92431713 |
12 | 36b49637171 |
13 | 17b89a6145b |
14 | aa2459147b |
15 | 5b70a2b26d |
hex | 33991ffb25 |
221612342053 has 2 divisors, whose sum is σ = 221612342054. Its totient is φ = 221612342052.
The previous prime is 221612341969. The next prime is 221612342087. The reversal of 221612342053 is 350243216122.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 177033087009 + 44579255044 = 420753^2 + 211138^2 .
It is a cyclic number.
It is not a de Polignac number, because 221612342053 - 221 = 221610244901 is a prime.
It is a super-2 number, since 2×2216123420532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (221612342153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 110806171026 + 110806171027.
It is an arithmetic number, because the mean of its divisors is an integer number (110806171027).
Almost surely, 2221612342053 is an apocalyptic number.
It is an amenable number.
221612342053 is a deficient number, since it is larger than the sum of its proper divisors (1).
221612342053 is an equidigital number, since it uses as much as digits as its factorization.
221612342053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 221612342053 its reverse (350243216122), we get a palindrome (571855558175).
The spelling of 221612342053 in words is "two hundred twenty-one billion, six hundred twelve million, three hundred forty-two thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •