Base | Representation |
---|---|
bin | 1001000110101010100011… |
… | …00100100011001000011101 |
3 | 2121212220122221012212201212 |
4 | 10203111101210203020131 |
5 | 10111002343020232422 |
6 | 110325054044114205 |
7 | 4134261331403123 |
oct | 443252144431035 |
9 | 77786587185655 |
10 | 20020211102237 |
11 | 6419584272315 |
12 | 22b4074235965 |
13 | b22b89632128 |
14 | 4d2daa5b5913 |
15 | 24ab894009e2 |
hex | 12355192321d |
20020211102237 has 2 divisors, whose sum is σ = 20020211102238. Its totient is φ = 20020211102236.
The previous prime is 20020211102197. The next prime is 20020211102293. The reversal of 20020211102237 is 73220111202002.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 14088507013156 + 5931704089081 = 3753466^2 + 2435509^2 .
It is a cyclic number.
It is not a de Polignac number, because 20020211102237 - 210 = 20020211101213 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20020211101237) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10010105551118 + 10010105551119.
It is an arithmetic number, because the mean of its divisors is an integer number (10010105551119).
Almost surely, 220020211102237 is an apocalyptic number.
It is an amenable number.
20020211102237 is a deficient number, since it is larger than the sum of its proper divisors (1).
20020211102237 is an equidigital number, since it uses as much as digits as its factorization.
20020211102237 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 20020211102237 its reverse (73220111202002), we get a palindrome (93240322304239).
The spelling of 20020211102237 in words is "twenty trillion, twenty billion, two hundred eleven million, one hundred two thousand, two hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •