Base | Representation |
---|---|
bin | 11001100001000101000010… |
… | …111011101100100000000011 |
3 | 112201100112121001111012010212 |
4 | 121201011002323230200003 |
5 | 104202140403244002321 |
6 | 1034403050434144335 |
7 | 32431640231613200 |
oct | 3141050273544003 |
9 | 481315531435125 |
10 | 112224323422211 |
11 | 32838082987300 |
12 | 107059aaa220ab |
13 | 4a8092915cb00 |
14 | 1d9d98705aca7 |
15 | ce932b23e55b |
hex | 661142eec803 |
112224323422211 has 108 divisors (see below), whose sum is σ = 156065280491736. Its totient is φ = 80365030986240.
The previous prime is 112224323422199. The next prime is 112224323422243.
It is a happy number.
112224323422211 is nontrivially palindromic in base 10.
It is not a de Polignac number, because 112224323422211 - 26 = 112224323422147 is a prime.
It is not an unprimeable number, because it can be changed into a prime (112224323422261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 107 ways as a sum of consecutive naturals, for example, 227207531 + ... + 227700923.
It is an arithmetic number, because the mean of its divisors is an integer number (1445048893442).
Almost surely, 2112224323422211 is an apocalyptic number.
112224323422211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
112224323422211 is a deficient number, since it is larger than the sum of its proper divisors (43840957069525).
112224323422211 is a wasteful number, since it uses less digits than its factorization.
112224323422211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 493682 (or 493651 counting only the distinct ones).
The product of its digits is 18432, while the sum is 32.
The spelling of 112224323422211 in words is "one hundred twelve trillion, two hundred twenty-four billion, three hundred twenty-three million, four hundred twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •