Base | Representation |
---|---|
bin | 11001100000101110100000… |
… | …010111001010011011110110 |
3 | 112201021020010100112211120120 |
4 | 121200232200113022123312 |
5 | 104201241322000200042 |
6 | 1034344005110312410 |
7 | 32430122411354124 |
oct | 3140564027123366 |
9 | 481236110484516 |
10 | 112200121100022 |
11 | 3282889334543a |
12 | 10701175658706 |
13 | 4a7b56cc754c7 |
14 | 1d9c72c9d6914 |
15 | ce88b15d5dec |
hex | 660ba05ca6f6 |
112200121100022 has 32 divisors (see below), whose sum is σ = 237899472129024. Its totient is φ = 35215382383200.
The previous prime is 112200121099999. The next prime is 112200121100029. The reversal of 112200121100022 is 220001121002211.
It is a junction number, because it is equal to n+sod(n) for n = 112200121099974 and 112200121100010.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112200121100029) 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 in 15 ways as a sum of consecutive naturals, for example, 8151702004 + ... + 8151715767.
It is an arithmetic number, because the mean of its divisors is an integer number (7434358504032).
Almost surely, 2112200121100022 is an apocalyptic number.
112200121100022 is an abundant number, since it is smaller than the sum of its proper divisors (125699351029002).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112200121100022 is a wasteful number, since it uses less digits than its factorization.
112200121100022 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16303417844.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112200121100022 its reverse (220001121002211), we get a palindrome (332201242102233).
The spelling of 112200121100022 in words is "one hundred twelve trillion, two hundred billion, one hundred twenty-one million, one hundred thousand, twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •