Base | Representation |
---|---|
bin | 11001011111100011111110… |
… | …110011011110010011001101 |
3 | 112200222120120121222210101112 |
4 | 121133203332303132103031 |
5 | 104143433431401413401 |
6 | 1034243132522221405 |
7 | 32421260425424150 |
oct | 3137437663362315 |
9 | 480876517883345 |
10 | 112120101201101 |
11 | 327a7960187a74 |
12 | 106a9763054865 |
13 | 4a73b599942a6 |
14 | 1d988db35bc97 |
15 | ce677b4d63bb |
hex | 65f8fecde4cd |
112120101201101 has 16 divisors (see below), whose sum is σ = 138983884421760. Its totient is φ = 88243736133120.
The previous prime is 112120101201023. The next prime is 112120101201139. The reversal of 112120101201101 is 101102101021211.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-112120101201101 is a prime.
It is a super-2 number, since 2×1121201012011012 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112120101201701) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 11490064931 + ... + 11490074688.
It is an arithmetic number, because the mean of its divisors is an integer number (8686492776360).
Almost surely, 2112120101201101 is an apocalyptic number.
It is an amenable number.
112120101201101 is a deficient number, since it is larger than the sum of its proper divisors (26863783220659).
112120101201101 is a wasteful number, since it uses less digits than its factorization.
112120101201101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 22980139684.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 112120101201101 its reverse (101102101021211), we get a palindrome (213222202222312).
The spelling of 112120101201101 in words is "one hundred twelve trillion, one hundred twenty billion, one hundred one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •