Base | Representation |
---|---|
bin | 10000010011001011111… |
… | …000100110100110010101 |
3 | 10222002012112112210221201 |
4 | 100103023320212212111 |
5 | 121322442200004343 |
6 | 2214323345512501 |
7 | 143632264561453 |
oct | 20231370464625 |
9 | 3862175483851 |
10 | 1120112109973 |
11 | 3a20450a298a |
12 | 161103342731 |
13 | 8181a77676c |
14 | 3c2dc6139d3 |
15 | 1e20b4b494d |
hex | 104cbe26995 |
1120112109973 has 2 divisors, whose sum is σ = 1120112109974. Its totient is φ = 1120112109972.
The previous prime is 1120112109923. The next prime is 1120112110021. The reversal of 1120112109973 is 3799012110211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 989304751044 + 130807358929 = 994638^2 + 361673^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120112109973 - 221 = 1120110012821 is a prime.
It is a super-2 number, since 2×11201121099732 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120112109913) 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, 560056054986 + 560056054987.
It is an arithmetic number, because the mean of its divisors is an integer number (560056054987).
Almost surely, 21120112109973 is an apocalyptic number.
It is an amenable number.
1120112109973 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120112109973 is an equidigital number, since it uses as much as digits as its factorization.
1120112109973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 37.
The spelling of 1120112109973 in words is "one trillion, one hundred twenty billion, one hundred twelve million, one hundred nine thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •