Base | Representation |
---|---|
bin | 1100110011101001000… |
… | …1111011110110101101 |
3 | 210000220122112120021212 |
4 | 3030322101323312231 |
5 | 12101100401042422 |
6 | 245024252004205 |
7 | 21616220411423 |
oct | 3147221736655 |
9 | 700818476255 |
10 | 220021112237 |
11 | 85346200153 |
12 | 36784760665 |
13 | 179951a9554 |
14 | a913101113 |
15 | 5acaeb09e2 |
hex | 333a47bdad |
220021112237 has 2 divisors, whose sum is σ = 220021112238. Its totient is φ = 220021112236.
The previous prime is 220021112221. The next prime is 220021112263. The reversal of 220021112237 is 732211120022.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 123602168041 + 96418944196 = 351571^2 + 310514^2 .
It is a cyclic number.
It is not a de Polignac number, because 220021112237 - 24 = 220021112221 is a prime.
It is a super-2 number, since 2×2200211122372 (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 (220021111237) 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, 110010556118 + 110010556119.
It is an arithmetic number, because the mean of its divisors is an integer number (110010556119).
Almost surely, 2220021112237 is an apocalyptic number.
It is an amenable number.
220021112237 is a deficient number, since it is larger than the sum of its proper divisors (1).
220021112237 is an equidigital number, since it uses as much as digits as its factorization.
220021112237 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 672, while the sum is 23.
Adding to 220021112237 its reverse (732211120022), we get a palindrome (952232232259).
The spelling of 220021112237 in words is "two hundred twenty billion, twenty-one million, one hundred twelve thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •