Base | Representation |
---|---|
bin | 111100011010011… |
… | …0100011100011101 |
3 | 12020021100222012102 |
4 | 1320310310130131 |
5 | 13122420042341 |
6 | 533052014445 |
7 | 101143112111 |
oct | 17064643435 |
9 | 5207328172 |
10 | 2027112221 |
11 | 950285462 |
12 | 486a61425 |
13 | 263c7aab4 |
14 | 153315741 |
15 | bce6ac9b |
hex | 78d3471d |
2027112221 has 2 divisors, whose sum is σ = 2027112222. Its totient is φ = 2027112220.
The previous prime is 2027112211. The next prime is 2027112247. The reversal of 2027112221 is 1222117202.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1716859225 + 310252996 = 41435^2 + 17614^2 .
It is a cyclic number.
It is not a de Polignac number, because 2027112221 - 222 = 2022917917 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2027112193 and 2027112202.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2027112211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1013556110 + 1013556111.
It is an arithmetic number, because the mean of its divisors is an integer number (1013556111).
Almost surely, 22027112221 is an apocalyptic number.
It is an amenable number.
2027112221 is a deficient number, since it is larger than the sum of its proper divisors (1).
2027112221 is an equidigital number, since it uses as much as digits as its factorization.
2027112221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 224, while the sum is 20.
The square root of 2027112221 is about 45023.4630054153. The cubic root of 2027112221 is about 1265.5887256390.
Adding to 2027112221 its reverse (1222117202), we get a palindrome (3249229423).
The spelling of 2027112221 in words is "two billion, twenty-seven million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •