Base | Representation |
---|---|
bin | 10000001011101110111… |
… | …110110101100101101010 |
3 | 10221022112221001221012020 |
4 | 100023232332311211222 |
5 | 121210100404342302 |
6 | 2210521410325310 |
7 | 143230101430011 |
oct | 20135676654552 |
9 | 3838487057166 |
10 | 1112111012202 |
11 | 399709745793 |
12 | 15b64b889836 |
13 | 80b43c3aa98 |
14 | 3bb7db41a78 |
15 | 1ddddd4debc |
hex | 102eefb596a |
1112111012202 has 8 divisors (see below), whose sum is σ = 2224222024416. Its totient is φ = 370703670732.
The previous prime is 1112111012191. The next prime is 1112111012281. The reversal of 1112111012202 is 2022101112111.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
1112111012202 is an admirable 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, 92675917678 + ... + 92675917689.
It is an arithmetic number, because the mean of its divisors is an integer number (278027753052).
Almost surely, 21112111012202 is an apocalyptic number.
1112111012202 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.
1112111012202 is a wasteful number, since it uses less digits than its factorization.
1112111012202 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 185351835372.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1112111012202 its reverse (2022101112111), we get a palindrome (3134212124313).
Subtracting 1112111012202 from its reverse (2022101112111), we obtain a palindrome (909990099909).
The spelling of 1112111012202 in words is "one trillion, one hundred twelve billion, one hundred eleven million, twelve thousand, two hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •