Base | Representation |
---|---|
bin | 111110111100100… |
… | …0100000111100001 |
3 | 12110012022100201001 |
4 | 1331321010013201 |
5 | 13311200023243 |
6 | 545325512001 |
7 | 103224435142 |
oct | 17571040741 |
9 | 5405270631 |
10 | 2112111073 |
11 | 994260346 |
12 | 4ab412601 |
13 | 27876b587 |
14 | 16071dac9 |
15 | c565aa4d |
hex | 7de441e1 |
2112111073 has 2 divisors, whose sum is σ = 2112111074. Its totient is φ = 2112111072.
The previous prime is 2112111061. The next prime is 2112111083. The reversal of 2112111073 is 3701112112.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1786921984 + 325189089 = 42272^2 + 18033^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112111073 - 221 = 2110013921 is a prime.
It is a super-2 number, since 2×21121110732 = 8922026369378422658, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2112111073.
It is not a weakly prime, because it can be changed into another prime (2112111013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056055536 + 1056055537.
It is an arithmetic number, because the mean of its divisors is an integer number (1056055537).
Almost surely, 22112111073 is an apocalyptic number.
It is an amenable number.
2112111073 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112111073 is an equidigital number, since it uses as much as digits as its factorization.
2112111073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 84, while the sum is 19.
The square root of 2112111073 is about 45957.7096143835. The cubic root of 2112111073 is about 1283.0362234261.
Adding to 2112111073 its reverse (3701112112), we get a palindrome (5813223185).
The spelling of 2112111073 in words is "two billion, one hundred twelve million, one hundred eleven thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •