Base | Representation |
---|---|
bin | 11001100000101110011010… |
… | …011001010110101100010011 |
3 | 112201021012212101012210112212 |
4 | 121200232122121112230103 |
5 | 104201241120334324334 |
6 | 1034343551133142335 |
7 | 32430120054542051 |
oct | 3140563231265423 |
9 | 481235771183485 |
10 | 112200021011219 |
11 | 328288418a3219 |
12 | 1070114802a9ab |
13 | 4a7b55530046b |
14 | 1d9c71d5c11d1 |
15 | ce88a7914ece |
hex | 660b9a656b13 |
112200021011219 has 2 divisors, whose sum is σ = 112200021011220. Its totient is φ = 112200021011218.
The previous prime is 112200021011203. The next prime is 112200021011227. The reversal of 112200021011219 is 912110120002211.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 112200021011219 - 24 = 112200021011203 is a prime.
It is a super-2 number, since 2×1122000210112192 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 112200021011194 and 112200021011203.
It is not a weakly prime, because it can be changed into another prime (112200021011279) 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, 56100010505609 + 56100010505610.
It is an arithmetic number, because the mean of its divisors is an integer number (56100010505610).
Almost surely, 2112200021011219 is an apocalyptic number.
112200021011219 is a deficient number, since it is larger than the sum of its proper divisors (1).
112200021011219 is an equidigital number, since it uses as much as digits as its factorization.
112200021011219 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 144, while the sum is 23.
The spelling of 112200021011219 in words is "one hundred twelve trillion, two hundred billion, twenty-one million, eleven thousand, two hundred nineteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •