Base | Representation |
---|---|
bin | 11001000011101001110011… |
… | …101101001101001100001000 |
3 | 112110012020011122022100120200 |
4 | 121003221303231031030020 |
5 | 103421023112300023422 |
6 | 1030214110343052200 |
7 | 32132563356224232 |
oct | 3103516355151410 |
9 | 473166148270520 |
10 | 110202212111112 |
11 | 3212854a8531a0 |
12 | 10439b15a41060 |
13 | 49650409a2704 |
14 | 1d2db5bb33252 |
15 | cb192be972ac |
hex | 643a73b4d308 |
110202212111112 has 96 divisors (see below), whose sum is σ = 328954119792480. Its totient is φ = 33050335380480.
The previous prime is 110202212111059. The next prime is 110202212111149. The reversal of 110202212111112 is 211111212202011.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 717161358 + ... + 717315005.
It is an arithmetic number, because the mean of its divisors is an integer number (3426605414505).
Almost surely, 2110202212111112 is an apocalyptic number.
110202212111112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110202212111112 is an abundant number, since it is smaller than the sum of its proper divisors (218751907681368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110202212111112 is a wasteful number, since it uses less digits than its factorization.
110202212111112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1434476483 (or 1434476476 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 110202212111112 its reverse (211111212202011), we get a palindrome (321313424313123).
The spelling of 110202212111112 in words is "one hundred ten trillion, two hundred two billion, two hundred twelve million, one hundred eleven thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •