Base | Representation |
---|---|
bin | 11110101111001000111… |
… | …100000001101101101101 |
3 | 21110220221212011120020102 |
4 | 132233020330001231231 |
5 | 234101241212334242 |
6 | 4254155323000445 |
7 | 305413200541025 |
oct | 36571074015555 |
9 | 7426855146212 |
10 | 2112200121197 |
11 | 7448629a3581 |
12 | 2a1437669125 |
13 | 124244805b2a |
14 | 74333d42a85 |
15 | 39e23317e32 |
hex | 1ebc8f01b6d |
2112200121197 has 2 divisors, whose sum is σ = 2112200121198. Its totient is φ = 2112200121196.
The previous prime is 2112200121169. The next prime is 2112200121233. The reversal of 2112200121197 is 7911210022112.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1837016993956 + 275183127241 = 1355366^2 + 524579^2 .
It is a cyclic number.
It is not a de Polignac number, because 2112200121197 - 228 = 2111931685741 is a prime.
It is a super-2 number, since 2×21122001211972 (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 (2112200121137) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1056100060598 + 1056100060599.
It is an arithmetic number, because the mean of its divisors is an integer number (1056100060599).
Almost surely, 22112200121197 is an apocalyptic number.
It is an amenable number.
2112200121197 is a deficient number, since it is larger than the sum of its proper divisors (1).
2112200121197 is an equidigital number, since it uses as much as digits as its factorization.
2112200121197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 29.
The spelling of 2112200121197 in words is "two trillion, one hundred twelve billion, two hundred million, one hundred twenty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •