Base | Representation |
---|---|
bin | 11001011101111110101010… |
… | …010111001100110111110101 |
3 | 112200121011202210202110220011 |
4 | 121131332222113030313311 |
5 | 104140143130420234031 |
6 | 1034121141404140221 |
7 | 32410356455255050 |
oct | 3135765227146765 |
9 | 480534683673804 |
10 | 112011310321141 |
11 | 32765803602720 |
12 | 10690661237671 |
13 | 4a6680cb32a3a |
14 | 1d9353a99da97 |
15 | ce3a1062b6b1 |
hex | 65dfaa5ccdf5 |
112011310321141 has 16 divisors (see below), whose sum is σ = 139681368207360. Its totient is φ = 87262225890480.
The previous prime is 112011310321129. The next prime is 112011310321151. The reversal of 112011310321141 is 141123013110211.
It is a cyclic number.
It is not a de Polignac number, because 112011310321141 - 27 = 112011310321013 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112011310321121) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 160604941 + ... + 161300866.
It is an arithmetic number, because the mean of its divisors is an integer number (8730085512960).
Almost surely, 2112011310321141 is an apocalyptic number.
112011310321141 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112011310321141 is a deficient number, since it is larger than the sum of its proper divisors (27670057886219).
112011310321141 is a wasteful number, since it uses less digits than its factorization.
112011310321141 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 321910344.
The product of its (nonzero) digits is 144, while the sum is 22.
Adding to 112011310321141 its reverse (141123013110211), we get a palindrome (253134323431352).
The spelling of 112011310321141 in words is "one hundred twelve trillion, eleven billion, three hundred ten million, three hundred twenty-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •