Base | Representation |
---|---|
bin | 11110101101000110011… |
… | …001110011000010000001 |
3 | 21110201022020021110202121 |
4 | 132231012121303002001 |
5 | 234032300042010311 |
6 | 4253154131244241 |
7 | 305305006003666 |
oct | 36550631630201 |
9 | 7421266243677 |
10 | 2110010110081 |
11 | 743939776835 |
12 | 2a0b26149681 |
13 | 123c85b90c73 |
14 | 741a7145a6d |
15 | 39d45e20b71 |
hex | 1eb46673081 |
2110010110081 has 2 divisors, whose sum is σ = 2110010110082. Its totient is φ = 2110010110080.
The previous prime is 2110010110051. The next prime is 2110010110133. The reversal of 2110010110081 is 1800110100112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2034662605056 + 75347505025 = 1426416^2 + 274495^2 .
It is a cyclic number.
It is not a de Polignac number, because 2110010110081 - 231 = 2107862626433 is a prime.
It is a super-2 number, since 2×21100101100812 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2110010110051) 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, 1055005055040 + 1055005055041.
It is an arithmetic number, because the mean of its divisors is an integer number (1055005055041).
Almost surely, 22110010110081 is an apocalyptic number.
It is an amenable number.
2110010110081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2110010110081 is an equidigital number, since it uses as much as digits as its factorization.
2110010110081 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 2110010110081 its reverse (1800110100112), we get a palindrome (3910120210193).
The spelling of 2110010110081 in words is "two trillion, one hundred ten billion, ten million, one hundred ten thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •