Base | Representation |
---|---|
bin | 11001011101110101000100… |
… | …100010001110110110101101 |
3 | 112200120012012002122200010220 |
4 | 121131311010202032312231 |
5 | 104140011033033032341 |
6 | 1034112315443321553 |
7 | 32406543326064456 |
oct | 3135650442166655 |
9 | 480505162580126 |
10 | 112001012002221 |
11 | 327613a9462251 |
12 | 1068a6683802b9 |
13 | 4a6585b3b59c4 |
14 | 1d92c40d8412d |
15 | ce360b492a66 |
hex | 65dd4488edad |
112001012002221 has 8 divisors (see below), whose sum is σ = 149334813184224. Its totient is φ = 74667276077520.
The previous prime is 112001012002207. The next prime is 112001012002241. The reversal of 112001012002221 is 122200210100211.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 112001012002221 - 215 = 112001011969453 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 112001012002221.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112001012002241) 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, 12158386 + ... + 19282851.
It is an arithmetic number, because the mean of its divisors is an integer number (18666851648028).
Almost surely, 2112001012002221 is an apocalyptic number.
It is an amenable number.
112001012002221 is a deficient number, since it is larger than the sum of its proper divisors (37333801182003).
112001012002221 is a wasteful number, since it uses less digits than its factorization.
112001012002221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32628651.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112001012002221 its reverse (122200210100211), we get a palindrome (234201222102432).
The spelling of 112001012002221 in words is "one hundred twelve trillion, one billion, twelve million, two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •