Base | Representation |
---|---|
bin | 110100001101011110… |
… | …0011100000111001101 |
3 | 101201101220211011020211 |
4 | 1220122330130013031 |
5 | 3314111011413401 |
6 | 123301402242421 |
7 | 11046316325140 |
oct | 1503274340715 |
9 | 351356734224 |
10 | 112121201101 |
11 | 43606549978 |
12 | 198911b6411 |
13 | a75aacbaa0 |
14 | 55d8bcc057 |
15 | 2db344b951 |
hex | 1a1af1c1cd |
112121201101 has 16 divisors (see below), whose sum is σ = 138109224064. Its totient is φ = 88638058944.
The previous prime is 112121201069. The next prime is 112121201111. The reversal of 112121201101 is 101102121211.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 112121201101 - 25 = 112121201069 is a prime.
It is a super-2 number, since 2×1121212011012 (a number of 23 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112121201111) 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 15 ways as a sum of consecutive naturals, for example, 397491 + ... + 618256.
It is an arithmetic number, because the mean of its divisors is an integer number (8631826504).
Almost surely, 2112121201101 is an apocalyptic number.
It is an amenable number.
112121201101 is a deficient number, since it is larger than the sum of its proper divisors (25988022963).
112121201101 is a wasteful number, since it uses less digits than its factorization.
112121201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1016980.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 112121201101 its reverse (101102121211), we get a palindrome (213223322312).
The spelling of 112121201101 in words is "one hundred twelve billion, one hundred twenty-one million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •