Base | Representation |
---|---|
bin | 11001011101110110001100… |
… | …101010110011110010101101 |
3 | 112200120022022102212121102102 |
4 | 121131312030222303302231 |
5 | 104140021022341211341 |
6 | 1034113035514304445 |
7 | 32406615322506620 |
oct | 3135661452636255 |
9 | 480508272777372 |
10 | 112002222210221 |
11 | 3276196a600452 |
12 | 1068a945728125 |
13 | 4a659c2042605 |
14 | 1d92d179addb7 |
15 | ce367c847c9b |
hex | 65dd8cab3cad |
112002222210221 has 16 divisors (see below), whose sum is σ = 133700244153600. Its totient is φ = 91736899930368.
The previous prime is 112002222210169. The next prime is 112002222210269. The reversal of 112002222210221 is 122012222200211.
It is not a de Polignac number, because 112002222210221 - 218 = 112002221948077 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 112002222210193 and 112002222210202.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112002222213221) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 344567966 + ... + 344892863.
It is an arithmetic number, because the mean of its divisors is an integer number (8356265259600).
Almost surely, 2112002222210221 is an apocalyptic number.
It is an amenable number.
112002222210221 is a deficient number, since it is larger than the sum of its proper divisors (21698021943379).
112002222210221 is a wasteful number, since it uses less digits than its factorization.
112002222210221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 689461868.
The product of its (nonzero) digits is 256, while the sum is 20.
Adding to 112002222210221 its reverse (122012222200211), we get a palindrome (234014444410432).
The spelling of 112002222210221 in words is "one hundred twelve trillion, two billion, two hundred twenty-two million, two hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •