Base | Representation |
---|---|
bin | 11001100000110000010000… |
… | …011110010011101011101101 |
3 | 112201021101222102211112020020 |
4 | 121200300100132103223231 |
5 | 104201304200004133401 |
6 | 1034344515501112353 |
7 | 32430220131052056 |
oct | 3140602036235355 |
9 | 481241872745206 |
10 | 112202002021101 |
11 | 3282966904a273 |
12 | 107015bb5586b9 |
13 | 4a7b7ac858c65 |
14 | 1d9c86a73572d |
15 | ce89717c5d36 |
hex | 660c10793aed |
112202002021101 has 4 divisors (see below), whose sum is σ = 149602669361472. Its totient is φ = 74801334680732.
The previous prime is 112202002021019. The next prime is 112202002021129. The reversal of 112202002021101 is 101120200202211.
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 112202002021101 - 215 = 112202001988333 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (112202002021301) 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, 18700333670181 + ... + 18700333670186.
It is an arithmetic number, because the mean of its divisors is an integer number (37400667340368).
Almost surely, 2112202002021101 is an apocalyptic number.
It is an amenable number.
112202002021101 is a deficient number, since it is larger than the sum of its proper divisors (37400667340371).
112202002021101 is an equidigital number, since it uses as much as digits as its factorization.
112202002021101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 37400667340370.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112202002021101 its reverse (101120200202211), we get a palindrome (213322202223312).
The spelling of 112202002021101 in words is "one hundred twelve trillion, two hundred two billion, two million, twenty-one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •