Base | Representation |
---|---|
bin | 11110101111000011000… |
… | …110100001111000001001 |
3 | 21110220201000221012210211 |
4 | 132233003012201320021 |
5 | 234101041131223311 |
6 | 4254141504241121 |
7 | 305410601401552 |
oct | 36570306417011 |
9 | 7426630835724 |
10 | 2112102211081 |
11 | 7448126aa225 |
12 | 2a140a9101a1 |
13 | 12422a444655 |
14 | 74324d37329 |
15 | 39e19927821 |
hex | 1ebc31a1e09 |
2112102211081 has 2 divisors, whose sum is σ = 2112102211082. Its totient is φ = 2112102211080.
The previous prime is 2112102211069. The next prime is 2112102211147. The reversal of 2112102211081 is 1801122012112.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2095994540025 + 16107671056 = 1447755^2 + 126916^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112102211081 - 25 = 2112102211049 is a prime.
It is a super-3 number, since 3×21121022110813 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (2112102211001) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056051105540 + 1056051105541.
It is an arithmetic number, because the mean of its divisors is an integer number (1056051105541).
Almost surely, 22112102211081 is an apocalyptic number.
It is an amenable number.
2112102211081 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112102211081 is an equidigital number, since it uses as much as digits as its factorization.
2112102211081 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 22.
Adding to 2112102211081 its reverse (1801122012112), we get a palindrome (3913224223193).
The spelling of 2112102211081 in words is "two trillion, one hundred twelve billion, one hundred two million, two hundred eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •