Base | Representation |
---|---|
bin | 11001011111010011001110… |
… | …100001000100001101100110 |
3 | 112200220212010212122001102020 |
4 | 121133103032201010031212 |
5 | 104143140110431400402 |
6 | 1034230555434124010 |
7 | 32420052551065512 |
oct | 3137231641041546 |
9 | 480825125561366 |
10 | 112102111200102 |
11 | 327a0269304a51 |
12 | 106a6182280606 |
13 | 4a72250854c9a |
14 | 1d97ab1db5142 |
15 | ce6076e558bc |
hex | 65f4ce844366 |
112102111200102 has 8 divisors (see below), whose sum is σ = 224204222400216. Its totient is φ = 37367370400032.
The previous prime is 112102111200073. The next prime is 112102111200173. The reversal of 112102111200102 is 201002111201211.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
112102111200102 is an admirable number.
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 in 3 ways as a sum of consecutive naturals, for example, 9341842600003 + ... + 9341842600014.
It is an arithmetic number, because the mean of its divisors is an integer number (28025527800027).
Almost surely, 2112102111200102 is an apocalyptic number.
112102111200102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112102111200102 is a wasteful number, since it uses less digits than its factorization.
112102111200102 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 18683685200022.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 112102111200102 its reverse (201002111201211), we get a palindrome (313104222401313).
The spelling of 112102111200102 in words is "one hundred twelve trillion, one hundred two billion, one hundred eleven million, two hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •