Base | Representation |
---|---|
bin | 11001100000111000111100… |
… | …100110100111011011000001 |
3 | 112201022022001200110101111222 |
4 | 121200320330212213123001 |
5 | 104201432302034044301 |
6 | 1034353101402044425 |
7 | 32431000264302245 |
oct | 3140707446473301 |
9 | 481268050411458 |
10 | 112211332331201 |
11 | 32832616837354 |
12 | 107033841a9715 |
13 | 4a7c63888a1cc |
14 | 1d9d0b3970425 |
15 | ce8d1a99c31b |
hex | 660e3c9a76c1 |
112211332331201 has 32 divisors (see below), whose sum is σ = 121155291302400. Its totient is φ = 103591763066880.
The previous prime is 112211332331167. The next prime is 112211332331221. The reversal of 112211332331201 is 102133233112211.
It is a cyclic number.
It is not a de Polignac number, because 112211332331201 - 234 = 112194152462017 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (112211332331221) 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 31 ways as a sum of consecutive naturals, for example, 208097105 + ... + 208635633.
It is an arithmetic number, because the mean of its divisors is an integer number (3786102853200).
Almost surely, 2112211332331201 is an apocalyptic number.
It is an amenable number.
112211332331201 is a deficient number, since it is larger than the sum of its proper divisors (8943958971199).
112211332331201 is a wasteful number, since it uses less digits than its factorization.
112211332331201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539609.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 112211332331201 its reverse (102133233112211), we get a palindrome (214344565443412).
The spelling of 112211332331201 in words is "one hundred twelve trillion, two hundred eleven billion, three hundred thirty-two million, three hundred thirty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •