Base | Representation |
---|---|
bin | 11001000010010101111001… |
… | …110111101111010001000100 |
3 | 112102212121122001102000022210 |
4 | 121002111321313233101010 |
5 | 103413034111013102322 |
6 | 1030104450554423420 |
7 | 32123224004263404 |
oct | 3102257167572104 |
9 | 472777561360283 |
10 | 110112121222212 |
11 | 320a33198a3a0a |
12 | 10424572731b70 |
13 | 49596b40a9a25 |
14 | 1d29652b36804 |
15 | cae407b6570c |
hex | 642579def444 |
110112121222212 has 96 divisors (see below), whose sum is σ = 266598095475712. Its totient is φ = 35343560082816.
The previous prime is 110112121222157. The next prime is 110112121222217. The reversal of 110112121222212 is 212222121211011.
It is a super-2 number, since 2×1101121212222122 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (110112121222217) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 73666023 + ... + 75145905.
Almost surely, 2110112121222212 is an apocalyptic number.
110112121222212 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
110112121222212 is an abundant number, since it is smaller than the sum of its proper divisors (156485974253500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110112121222212 is a wasteful number, since it uses less digits than its factorization.
110112121222212 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1481657 (or 1481655 counting only the distinct ones).
The product of its (nonzero) digits is 128, while the sum is 21.
Adding to 110112121222212 its reverse (212222121211011), we get a palindrome (322334242433223).
The spelling of 110112121222212 in words is "one hundred ten trillion, one hundred twelve billion, one hundred twenty-one million, two hundred twenty-two thousand, two hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •