Base | Representation |
---|---|
bin | 110100010000011100… |
… | …1111010011010110101 |
3 | 101201122212222201211120 |
4 | 1220200321322122311 |
5 | 3314312111431401 |
6 | 123315333454153 |
7 | 11051642323221 |
oct | 1504071723265 |
9 | 351585881746 |
10 | 112221202101 |
11 | 43657a41128 |
12 | 198ba7a1359 |
13 | a775742b88 |
14 | 56081bd781 |
15 | 2dbc101836 |
hex | 1a20e7a6b5 |
112221202101 has 8 divisors (see below), whose sum is σ = 149653997664. Its totient is φ = 74801270640.
The previous prime is 112221202099. The next prime is 112221202103. The reversal of 112221202101 is 101202122211.
It is an interprime number because it is at equal distance from previous prime (112221202099) and next prime (112221202103).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112221202101 - 21 = 112221202099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112221202103) 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 7 ways as a sum of consecutive naturals, for example, 3195651 + ... + 3230576.
It is an arithmetic number, because the mean of its divisors is an integer number (18706749708).
Almost surely, 2112221202101 is an apocalyptic number.
It is an amenable number.
112221202101 is a deficient number, since it is larger than the sum of its proper divisors (37432795563).
112221202101 is an equidigital number, since it uses as much as digits as its factorization.
112221202101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6432051.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112221202101 its reverse (101202122211), we get a palindrome (213423324312).
The spelling of 112221202101 in words is "one hundred twelve billion, two hundred twenty-one million, two hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •