Base | Representation |
---|---|
bin | 11001011111100100111010… |
… | …111100000111100011110011 |
3 | 112200222200011221102011210020 |
4 | 121133210322330013203303 |
5 | 104143443013141201321 |
6 | 1034243421002334523 |
7 | 32421324426061032 |
oct | 3137447274074363 |
9 | 480880157364706 |
10 | 112121110100211 |
11 | 327a8328729893 |
12 | 106a99a4aba443 |
13 | 4a73c8a9c8c04 |
14 | 1d98995344719 |
15 | ce67d9d744c6 |
hex | 65f93af078f3 |
112121110100211 has 4 divisors (see below), whose sum is σ = 149494813466952. Its totient is φ = 74747406733472.
The previous prime is 112121110100191. The next prime is 112121110100213. The reversal of 112121110100211 is 112001011121211.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112121110100211 is a prime.
It is a super-2 number, since 2×1121211101002112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112121110100213) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 18686851683366 + ... + 18686851683371.
It is an arithmetic number, because the mean of its divisors is an integer number (37373703366738).
Almost surely, 2112121110100211 is an apocalyptic number.
112121110100211 is a deficient number, since it is larger than the sum of its proper divisors (37373703366741).
112121110100211 is an equidigital number, since it uses as much as digits as its factorization.
112121110100211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37373703366740.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 112121110100211 its reverse (112001011121211), we get a palindrome (224122121221422).
The spelling of 112121110100211 in words is "one hundred twelve trillion, one hundred twenty-one billion, one hundred ten million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •