Base | Representation |
---|---|
bin | 11001011111010010010011… |
… | …100000001011010000111110 |
3 | 112200220202120212121022122021 |
4 | 121133102103200023100332 |
5 | 104143131044001023402 |
6 | 1034230313305110354 |
7 | 32420016166343614 |
oct | 3137222340132076 |
9 | 480822525538567 |
10 | 112101121111102 |
11 | 3279a900440482 |
12 | 106a5b467883ba |
13 | 4a721236a7cc6 |
14 | 1d97a1a6c76b4 |
15 | ce601a080d37 |
hex | 65f49380b43e |
112101121111102 has 4 divisors (see below), whose sum is σ = 168151681666656. Its totient is φ = 56050560555550.
The previous prime is 112101121111079. The next prime is 112101121111193. The reversal of 112101121111102 is 201111121101211.
It is a semiprime because it is the product of two primes.
It is a super-2 number, since 2×1121011211111022 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 28025280277774 + ... + 28025280277777.
It is an arithmetic number, because the mean of its divisors is an integer number (42037920416664).
Almost surely, 2112101121111102 is an apocalyptic number.
112101121111102 is a deficient number, since it is larger than the sum of its proper divisors (56050560555554).
112101121111102 is an equidigital number, since it uses as much as digits as its factorization.
112101121111102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56050560555553.
The product of its (nonzero) digits is 8, while the sum is 16.
Adding to 112101121111102 its reverse (201111121101211), we get a palindrome (313212242212313).
The spelling of 112101121111102 in words is "one hundred twelve trillion, one hundred one billion, one hundred twenty-one million, one hundred eleven thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •