Base | Representation |
---|---|
bin | 11001011101111101011100… |
… | …111110100011001000110111 |
3 | 112200121001102022202121002120 |
4 | 121131331130332203020313 |
5 | 104140133001033404421 |
6 | 1034120404505011023 |
7 | 32410312341652332 |
oct | 3135753476431067 |
9 | 480531368677076 |
10 | 112010012013111 |
11 | 327651a7760683 |
12 | 1069035a483a73 |
13 | 4a66663b6ac34 |
14 | 1d9345639d619 |
15 | ce39866728c6 |
hex | 65df5cfa3237 |
112010012013111 has 16 divisors (see below), whose sum is σ = 151421240104416. Its totient is φ = 73636450638336.
The previous prime is 112010012013091. The next prime is 112010012013157. The reversal of 112010012013111 is 111310210010211.
It is not a de Polignac number, because 112010012013111 - 211 = 112010012011063 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112010012013511) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 47343340 + ... + 49652913.
It is an arithmetic number, because the mean of its divisors is an integer number (9463827506526).
Almost surely, 2112010012013111 is an apocalyptic number.
112010012013111 is a deficient number, since it is larger than the sum of its proper divisors (39411228091305).
112010012013111 is an equidigital number, since it uses as much as digits as its factorization.
112010012013111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 97001602.
The product of its (nonzero) digits is 12, while the sum is 15.
Adding to 112010012013111 its reverse (111310210010211), we get a palindrome (223320222023322).
The spelling of 112010012013111 in words is "one hundred twelve trillion, ten billion, twelve million, thirteen thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •