Base | Representation |
---|---|
bin | 111110100101110… |
… | …1101100000111101 |
3 | 12102100221022222111 |
4 | 1331023231200331 |
5 | 13300124101023 |
6 | 544223014021 |
7 | 103021410151 |
oct | 17513554075 |
9 | 5370838874 |
10 | 2100222013 |
11 | 98857a97a |
12 | 4a743a311 |
13 | 276167c26 |
14 | 15cd07061 |
15 | c45ad00d |
hex | 7d2ed83d |
2100222013 has 2 divisors, whose sum is σ = 2100222014. Its totient is φ = 2100222012.
The previous prime is 2100221993. The next prime is 2100222053. The reversal of 2100222013 is 3102220012.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1909864804 + 190357209 = 43702^2 + 13797^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2100222013 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2100221984 and 2100222002.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2100222053) 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, 1050111006 + 1050111007.
It is an arithmetic number, because the mean of its divisors is an integer number (1050111007).
Almost surely, 22100222013 is an apocalyptic number.
It is an amenable number.
2100222013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2100222013 is an equidigital number, since it uses as much as digits as its factorization.
2100222013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 13.
The square root of 2100222013 is about 45828.1792459618. The cubic root of 2100222013 is about 1280.6242912103.
Adding to 2100222013 its reverse (3102220012), we get a palindrome (5202442025).
The spelling of 2100222013 in words is "two billion, one hundred million, two hundred twenty-two thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •