Base | Representation |
---|---|
bin | 11001011101110100010100… |
… | …001000101110110111010101 |
3 | 112200120010002111202020220011 |
4 | 121131310110020232313111 |
5 | 104140002402200324341 |
6 | 1034112103115440221 |
7 | 32406514236216664 |
oct | 3135642410566725 |
9 | 480503074666804 |
10 | 112000200011221 |
11 | 32761022081405 |
12 | 1068a480456071 |
13 | 4a6575c0c4c62 |
14 | 1d92ba51b6ddb |
15 | ce35b004cb81 |
hex | 65dd1422edd5 |
112000200011221 has 4 divisors (see below), whose sum is σ = 112011695474112. Its totient is φ = 111988704548332.
The previous prime is 112000200011131. The next prime is 112000200011263. The reversal of 112000200011221 is 122110002000211.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 112000200011221 - 27 = 112000200011093 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 (112000200012221) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5747716831 + ... + 5747736316.
It is an arithmetic number, because the mean of its divisors is an integer number (28002923868528).
Almost surely, 2112000200011221 is an apocalyptic number.
It is an amenable number.
112000200011221 is a deficient number, since it is larger than the sum of its proper divisors (11495462891).
112000200011221 is an equidigital number, since it uses as much as digits as its factorization.
112000200011221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11495462890.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112000200011221 its reverse (122110002000211), we get a palindrome (234110202011432).
The spelling of 112000200011221 in words is "one hundred twelve trillion, two hundred million, eleven thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •