Base | Representation |
---|---|
bin | 11001100000110000010000… |
… | …011110100110111110000101 |
3 | 112201021101222102222112121011 |
4 | 121200300100132212332011 |
5 | 104201304200014200401 |
6 | 1034344515502522221 |
7 | 32430220131531304 |
oct | 3140602036467605 |
9 | 481241872875534 |
10 | 112202002100101 |
11 | 328296690a3661 |
12 | 107015bb596371 |
13 | 4a7b7ac885bc4 |
14 | 1d9c86a75643b |
15 | ce89717de451 |
hex | 660c107a6f85 |
112202002100101 has 4 divisors (see below), whose sum is σ = 112202520314752. Its totient is φ = 112201483885452.
The previous prime is 112202002100087. The next prime is 112202002100143. The reversal of 112202002100101 is 101001200202211.
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 112202002100101 - 245 = 77017630011269 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 (112202002100161) 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, 258782415 + ... + 259215628.
It is an arithmetic number, because the mean of its divisors is an integer number (28050630078688).
Almost surely, 2112202002100101 is an apocalyptic number.
It is an amenable number.
112202002100101 is a deficient number, since it is larger than the sum of its proper divisors (518214651).
112202002100101 is an equidigital number, since it uses as much as digits as its factorization.
112202002100101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 518214650.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 112202002100101 its reverse (101001200202211), we get a palindrome (213203202302312).
The spelling of 112202002100101 in words is "one hundred twelve trillion, two hundred two billion, two million, one hundred thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •