Base | Representation |
---|---|
bin | 110100001111110110… |
… | …1001111001100010101 |
3 | 101201121111011112211010 |
4 | 1220133231033030111 |
5 | 3314241440231401 |
6 | 123313335002433 |
7 | 11051306426514 |
oct | 1503755171425 |
9 | 351544145733 |
10 | 112201102101 |
11 | 43647662760 |
12 | 198b3b09419 |
13 | a77152609a |
14 | 560566a67b |
15 | 2dba480ed6 |
hex | 1a1fb4f315 |
112201102101 has 64 divisors (see below), whose sum is σ = 172321966080. Its totient is φ = 64273440000.
The previous prime is 112201102007. The next prime is 112201102133. The reversal of 112201102101 is 101201102211.
It is not a de Polignac number, because 112201102101 - 29 = 112201101589 is a prime.
It is a super-2 number, since 2×1122011021012 (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 (112201102201) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 50517171 + ... + 50519391.
It is an arithmetic number, because the mean of its divisors is an integer number (2692530720).
Almost surely, 2112201102101 is an apocalyptic number.
112201102101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112201102101 is a deficient number, since it is larger than the sum of its proper divisors (60120863979).
112201102101 is a wasteful number, since it uses less digits than its factorization.
112201102101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3018.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 112201102101 its reverse (101201102211), we get a palindrome (213402204312).
It can be divided in two parts, 11220110 and 2101, that added together give a palindrome (11222211).
The spelling of 112201102101 in words is "one hundred twelve billion, two hundred one million, one hundred two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •