Base | Representation |
---|---|
bin | 11001011111010011010101… |
… | …000000100100000010011101 |
3 | 112200220212102110120202201201 |
4 | 121133103111000210002131 |
5 | 104143140321322321341 |
6 | 1034231014324435501 |
7 | 32420055342642052 |
oct | 3137232500440235 |
9 | 480825373522651 |
10 | 112102220120221 |
11 | 327a0314839281 |
12 | 106a61b2848b91 |
13 | 4a7226a29c966 |
14 | 1d97ac2649029 |
15 | ce60817bd331 |
hex | 65f4d502409d |
112102220120221 has 8 divisors (see below), whose sum is σ = 116662231969920. Its totient is φ = 107588502807408.
The previous prime is 112102220120201. The next prime is 112102220120249. The reversal of 112102220120221 is 122021022201211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 112102220120221 - 215 = 112102220087453 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112102220120201) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11573629281 + ... + 11573638966.
It is an arithmetic number, because the mean of its divisors is an integer number (14582778996240).
Almost surely, 2112102220120221 is an apocalyptic number.
It is an amenable number.
112102220120221 is a deficient number, since it is larger than the sum of its proper divisors (4560011849699).
112102220120221 is a wasteful number, since it uses less digits than its factorization.
112102220120221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23147268443.
The product of its (nonzero) digits is 128, while the sum is 19.
Adding to 112102220120221 its reverse (122021022201211), we get a palindrome (234123242321432).
The spelling of 112102220120221 in words is "one hundred twelve trillion, one hundred two billion, two hundred twenty million, one hundred twenty thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •