Base | Representation |
---|---|
bin | 110100001101011101… |
… | …1101011100001011001 |
3 | 101201101220110001020102 |
4 | 1220122323223201121 |
5 | 3314110434031243 |
6 | 123301354105145 |
7 | 11046314535653 |
oct | 1503273534131 |
9 | 351356401212 |
10 | 112121002073 |
11 | 43606423393 |
12 | 1989111b1b5 |
13 | a75aa5c312 |
14 | 55d8b796d3 |
15 | 2db340c9b8 |
hex | 1a1aeeb859 |
112121002073 has 2 divisors, whose sum is σ = 112121002074. Its totient is φ = 112121002072.
The previous prime is 112121001953. The next prime is 112121002093. The reversal of 112121002073 is 370200121211.
It is an a-pointer prime, because the next prime (112121002093) can be obtained adding 112121002073 to its sum of digits (20).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 104812120009 + 7308882064 = 323747^2 + 85492^2 .
It is a cyclic number.
It is not a de Polignac number, because 112121002073 - 232 = 107826034777 is a prime.
It is a super-2 number, since 2×1121210020732 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (112121002093) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 56060501036 + 56060501037.
It is an arithmetic number, because the mean of its divisors is an integer number (56060501037).
Almost surely, 2112121002073 is an apocalyptic number.
It is an amenable number.
112121002073 is a deficient number, since it is larger than the sum of its proper divisors (1).
112121002073 is an equidigital number, since it uses as much as digits as its factorization.
112121002073 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 168, while the sum is 20.
Adding to 112121002073 its reverse (370200121211), we get a palindrome (482321123284).
The spelling of 112121002073 in words is "one hundred twelve billion, one hundred twenty-one million, two thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •