Base | Representation |
---|---|
bin | 110100001010011101… |
… | …1001100010110011101 |
3 | 101201010212210100000110 |
4 | 1220110323030112131 |
5 | 3313404133223401 |
6 | 123243353520233 |
7 | 11043652040511 |
oct | 1502473142635 |
9 | 351125710013 |
10 | 112020211101 |
11 | 43564541667 |
12 | 19863413079 |
13 | a742bcc7a6 |
14 | 55c9620141 |
15 | 2da964d9d6 |
hex | 1a14ecc59d |
112020211101 has 32 divisors (see below), whose sum is σ = 155014449408. Its totient is φ = 71896550400.
The previous prime is 112020211097. The next prime is 112020211139. The reversal of 112020211101 is 101112020211.
It is not a de Polignac number, because 112020211101 - 22 = 112020211097 is a prime.
It is a super-2 number, since 2×1120202111012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112020211801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 31759000 + ... + 31762526.
It is an arithmetic number, because the mean of its divisors is an integer number (4844201544).
Almost surely, 2112020211101 is an apocalyptic number.
It is an amenable number.
112020211101 is a deficient number, since it is larger than the sum of its proper divisors (42994238307).
112020211101 is a wasteful number, since it uses less digits than its factorization.
112020211101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6501.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112020211101 its reverse (101112020211), we get a palindrome (213132231312).
It can be divided in two parts, 112020211 and 101, that multiplied together give a palindrome (11314041311).
The spelling of 112020211101 in words is "one hundred twelve billion, twenty million, two hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •