Base | Representation |
---|---|
bin | 11001011101111111100000… |
… | …101001111110011000100101 |
3 | 112200121021010021202112111221 |
4 | 121131333200221332120211 |
5 | 104140202012112242242 |
6 | 1034121412023500341 |
7 | 32410421155564105 |
oct | 3135774051763045 |
9 | 480537107675457 |
10 | 112012221212197 |
11 | 327661307a3649 |
12 | 106908762b76b1 |
13 | 4a66926770727 |
14 | 1d935c5953205 |
15 | ce3a655aa167 |
hex | 65dfe0a7e625 |
112012221212197 has 4 divisors (see below), whose sum is σ = 112022557314316. Its totient is φ = 112001885110080.
The previous prime is 112012221212173. The next prime is 112012221212231. The reversal of 112012221212197 is 791212122210211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 79618661939041 + 32393559273156 = 8922929^2 + 5691534^2 .
It is a cyclic number.
It is not a de Polignac number, because 112012221212197 - 27 = 112012221212069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112012221213197) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5168034804 + ... + 5168056477.
It is an arithmetic number, because the mean of its divisors is an integer number (28005639328579).
Almost surely, 2112012221212197 is an apocalyptic number.
It is an amenable number.
112012221212197 is a deficient number, since it is larger than the sum of its proper divisors (10336102119).
112012221212197 is a wasteful number, since it uses less digits than its factorization.
112012221212197 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10336102118.
The product of its (nonzero) digits is 4032, while the sum is 34.
The spelling of 112012221212197 in words is "one hundred twelve trillion, twelve billion, two hundred twenty-one million, two hundred twelve thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •