Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …000001010110010001111 |
3 | 10221022021012120201001011 |
4 | 100023220120022302033 |
5 | 121204334023241421 |
6 | 2210502411430051 |
7 | 143224254563455 |
oct | 20135030126217 |
9 | 3838235521034 |
10 | 1112000212111 |
11 | 399662147a68 |
12 | 15b61a755327 |
13 | 80b26cb54b9 |
14 | 3bb6d13c9d5 |
15 | 1ddd42644e1 |
hex | 102e860ac8f |
1112000212111 has 24 divisors (see below), whose sum is σ = 1196748048384. Its totient is φ = 1032892440960.
The previous prime is 1112000212109. The next prime is 1112000212151. The reversal of 1112000212111 is 1112120002111.
It is a happy number.
It is not a de Polignac number, because 1112000212111 - 21 = 1112000212109 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1112000212091 and 1112000212100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1112000212151) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23267506 + ... + 23315248.
It is an arithmetic number, because the mean of its divisors is an integer number (49864502016).
Almost surely, 21112000212111 is an apocalyptic number.
1112000212111 is a deficient number, since it is larger than the sum of its proper divisors (84747836273).
1112000212111 is an equidigital number, since it uses as much as digits as its factorization.
1112000212111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 48831 (or 48814 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 1112000212111 its reverse (1112120002111), we get a palindrome (2224120214222).
The spelling of 1112000212111 in words is "one trillion, one hundred twelve billion, two hundred twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •