Base | Representation |
---|---|
bin | 11001000010010101000011… |
… | …101100000110000010100110 |
3 | 112102212112021200220220102020 |
4 | 121002111003230012002212 |
5 | 103413030230310400402 |
6 | 1030104220443124010 |
7 | 32123162325600231 |
oct | 3102250354060246 |
9 | 472775250826366 |
10 | 110111212200102 |
11 | 320a29a276a173 |
12 | 1042435a213606 |
13 | 495959a974919 |
14 | 1d295a810c418 |
15 | cae3a2e558bc |
hex | 642543b060a6 |
110111212200102 has 8 divisors (see below), whose sum is σ = 220222424400216. Its totient is φ = 36703737400032.
The previous prime is 110111212200097. The next prime is 110111212200103. The reversal of 110111212200102 is 201002212111011.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
110111212200102 is an admirable number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110111212200103) 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, 9175934350003 + ... + 9175934350014.
It is an arithmetic number, because the mean of its divisors is an integer number (27527803050027).
Almost surely, 2110111212200102 is an apocalyptic number.
110111212200102 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.
110111212200102 is a wasteful number, since it uses less digits than its factorization.
110111212200102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 18351868700022.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110111212200102 its reverse (201002212111011), we get a palindrome (311113424311113).
The spelling of 110111212200102 in words is "one hundred ten trillion, one hundred eleven billion, two hundred twelve million, two hundred thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •