Base | Representation |
---|---|
bin | 11001100000101110011010… |
… | …011101100000110000011101 |
3 | 112201021012212110021011110220 |
4 | 121200232122131200300131 |
5 | 104201241121124213041 |
6 | 1034343551212351553 |
7 | 32430120100031241 |
oct | 3140563235406035 |
9 | 481235773234426 |
10 | 112200022101021 |
11 | 32828842477a88 |
12 | 107011484755b9 |
13 | 4a7b5555c250a |
14 | 1d9c71d7c6421 |
15 | ce88a7a7cd66 |
hex | 660b9a760c1d |
112200022101021 has 4 divisors (see below), whose sum is σ = 149600029468032. Its totient is φ = 74800014734012.
The previous prime is 112200022100977. The next prime is 112200022101073. The reversal of 112200022101021 is 120101220002211.
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 112200022101021 - 229 = 112199485230109 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112200022101221) 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, 18700003683501 + ... + 18700003683506.
It is an arithmetic number, because the mean of its divisors is an integer number (37400007367008).
Almost surely, 2112200022101021 is an apocalyptic number.
It is an amenable number.
112200022101021 is a deficient number, since it is larger than the sum of its proper divisors (37400007367011).
112200022101021 is an equidigital number, since it uses as much as digits as its factorization.
112200022101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37400007367010.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112200022101021 its reverse (120101220002211), we get a palindrome (232301242103232).
The spelling of 112200022101021 in words is "one hundred twelve trillion, two hundred billion, twenty-two million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •