Base | Representation |
---|---|
bin | 11110101111000100010… |
… | …010000011100111011001 |
3 | 21110220202102012002220211 |
4 | 132233010102003213121 |
5 | 234101111213310243 |
6 | 4254143452451121 |
7 | 305411231602555 |
oct | 36570422034731 |
9 | 7426672162824 |
10 | 2112122010073 |
11 | 7448228a2529 |
12 | 2a1415479aa1 |
13 | 12423158742a |
14 | 7432780c865 |
15 | 39e1b538d9d |
hex | 1ebc44839d9 |
2112122010073 has 2 divisors, whose sum is σ = 2112122010074. Its totient is φ = 2112122010072.
The previous prime is 2112122010071. The next prime is 2112122010091. The reversal of 2112122010073 is 3700102212112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1673225035024 + 438896975049 = 1293532^2 + 662493^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112122010073 - 21 = 2112122010071 is a prime.
It is a super-2 number, since 2×21121220100732 (a number of 25 digits) contains 22 as substring.
Together with 2112122010071, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (2112122010071) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056061005036 + 1056061005037.
It is an arithmetic number, because the mean of its divisors is an integer number (1056061005037).
Almost surely, 22112122010073 is an apocalyptic number.
It is an amenable number.
2112122010073 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112122010073 is an equidigital number, since it uses as much as digits as its factorization.
2112122010073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 336, while the sum is 22.
Adding to 2112122010073 its reverse (3700102212112), we get a palindrome (5812224222185).
The spelling of 2112122010073 in words is "two trillion, one hundred twelve billion, one hundred twenty-two million, ten thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •