Base | Representation |
---|---|
bin | 110100001100111010… |
… | …0000010100010110001 |
3 | 101201100121002220211012 |
4 | 1220121310002202301 |
5 | 3314041132101001 |
6 | 123255443400305 |
7 | 11045666110400 |
oct | 1503164024261 |
9 | 351317086735 |
10 | 112102222001 |
11 | 435a6866670 |
12 | 19886983095 |
13 | a756bb5253 |
14 | 55d648b637 |
15 | 2db194d2bb |
hex | 1a19d028b1 |
112102222001 has 48 divisors (see below), whose sum is σ = 150715131840. Its totient is φ = 82166353920.
The previous prime is 112102221997. The next prime is 112102222061. The reversal of 112102222001 is 100222201211.
It is not a de Polignac number, because 112102222001 - 22 = 112102221997 is a prime.
It is a super-2 number, since 2×1121022220012 (a number of 23 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (112102222061) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 27147905 + ... + 27152033.
It is an arithmetic number, because the mean of its divisors is an integer number (3139898580).
Almost surely, 2112102222001 is an apocalyptic number.
112102222001 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
112102222001 is a deficient number, since it is larger than the sum of its proper divisors (38612909839).
112102222001 is a wasteful number, since it uses less digits than its factorization.
112102222001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7134 (or 7127 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 112102222001 its reverse (100222201211), we get a palindrome (212324423212).
It can be divided in two parts, 11 and 2102222001, that added together give a palindrome (2102222012).
The spelling of 112102222001 in words is "one hundred twelve billion, one hundred two million, two hundred twenty-two thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •