Base | Representation |
---|---|
bin | 110100010011001000… |
… | …1101100101001010110 |
3 | 101201220011120100202212 |
4 | 1220212101230221112 |
5 | 3320003144320342 |
6 | 123332313233422 |
7 | 11054115332060 |
oct | 1504621545126 |
9 | 351804510685 |
10 | 112311323222 |
11 | 436a38a549a |
12 | 19924a02872 |
13 | a78b307c97 |
14 | 561615c730 |
15 | 2dc4ea4182 |
hex | 1a2646ca56 |
112311323222 has 8 divisors (see below), whose sum is σ = 192533696976. Its totient is φ = 48133424232.
The previous prime is 112311323219. The next prime is 112311323227. The reversal of 112311323222 is 222323113211.
112311323222 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a super-2 number, since 2×1123113232222 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112311323227) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4011118673 + ... + 4011118700.
It is an arithmetic number, because the mean of its divisors is an integer number (24066712122).
Almost surely, 2112311323222 is an apocalyptic number.
112311323222 is a deficient number, since it is larger than the sum of its proper divisors (80222373754).
112311323222 is an equidigital number, since it uses as much as digits as its factorization.
112311323222 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8022237382.
The product of its digits is 864, while the sum is 23.
Adding to 112311323222 its reverse (222323113211), we get a palindrome (334634436433).
The spelling of 112311323222 in words is "one hundred twelve billion, three hundred eleven million, three hundred twenty-three thousand, two hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •