Base | Representation |
---|---|
bin | 11001011101111101011101… |
… | …011101110100110110001111 |
3 | 112200121001102220012011000020 |
4 | 121131331131131310312033 |
5 | 104140133010133241421 |
6 | 1034120405400433223 |
7 | 32410312501441200 |
oct | 3135753535646617 |
9 | 480531386164006 |
10 | 112010020212111 |
11 | 3276520135070a |
12 | 10690361178813 |
13 | 4a6666577bb08 |
14 | 1d934574d55a7 |
15 | ce3987241dc6 |
hex | 65df5d774d8f |
112010020212111 has 12 divisors (see below), whose sum is σ = 173729827267992. Its totient is φ = 64005725835408.
The previous prime is 112010020212037. The next prime is 112010020212133. The reversal of 112010020212111 is 111212020010211.
It is a happy number.
It is not a de Polignac number, because 112010020212111 - 27 = 112010020211983 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112010020212161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 380986463160 + ... + 380986463453.
It is an arithmetic number, because the mean of its divisors is an integer number (14477485605666).
Almost surely, 2112010020212111 is an apocalyptic number.
112010020212111 is a deficient number, since it is larger than the sum of its proper divisors (61719807055881).
112010020212111 is an equidigital number, since it uses as much as digits as its factorization.
112010020212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 761972926630 (or 761972926623 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112010020212111 its reverse (111212020010211), we get a palindrome (223222040222322).
The spelling of 112010020212111 in words is "one hundred twelve trillion, ten billion, twenty million, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •