Base | Representation |
---|---|
bin | 11110101101001011111… |
… | …001001010110101010001 |
3 | 21110201112122121010222021 |
4 | 132231023321022311101 |
5 | 234032442132020423 |
6 | 4253211221411441 |
7 | 305310204635236 |
oct | 36551371126521 |
9 | 7421478533867 |
10 | 2110102220113 |
11 | 743986769428 |
12 | 2a0b50b69b81 |
13 | 123c9bca1444 |
14 | 741b548178d |
15 | 39d4e06795d |
hex | 1eb4be4ad51 |
2110102220113 has 2 divisors, whose sum is σ = 2110102220114. Its totient is φ = 2110102220112.
The previous prime is 2110102220111. The next prime is 2110102220117. The reversal of 2110102220113 is 3110222010112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2109953794624 + 148425489 = 1452568^2 + 12183^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110102220113 - 21 = 2110102220111 is a prime.
Together with 2110102220111, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2110102220111) 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, 1055051110056 + 1055051110057.
It is an arithmetic number, because the mean of its divisors is an integer number (1055051110057).
Almost surely, 22110102220113 is an apocalyptic number.
It is an amenable number.
2110102220113 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110102220113 is an equidigital number, since it uses as much as digits as its factorization.
2110102220113 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 16.
Adding to 2110102220113 its reverse (3110222010112), we get a palindrome (5220324230225).
The spelling of 2110102220113 in words is "two trillion, one hundred ten billion, one hundred two million, two hundred twenty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •