Base | Representation |
---|---|
bin | 11001000011111100010101… |
… | …001011010101111010010000 |
3 | 112110021010111201210012122122 |
4 | 121003330111023111322100 |
5 | 103421334330324341422 |
6 | 1030231200103153412 |
7 | 32134166262131315 |
oct | 3103742513257220 |
9 | 473233451705578 |
10 | 110222101012112 |
11 | 32135a2659a961 |
12 | 10441946745868 |
13 | 4966b9034b99b |
14 | 1d30ac7378d0c |
15 | cb21e30b9d42 |
hex | 643f152d5e90 |
110222101012112 has 80 divisors (see below), whose sum is σ = 220948206838272. Its totient is φ = 53211427476480.
The previous prime is 110222101011977. The next prime is 110222101012159. The reversal of 110222101012112 is 211210101222011.
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 15 ways as a sum of consecutive naturals, for example, 600321668 + ... + 600505244.
Almost surely, 2110222101012112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 110222101012112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (110474103419136).
110222101012112 is an abundant number, since it is smaller than the sum of its proper divisors (110726105826160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110222101012112 is a wasteful number, since it uses less digits than its factorization.
110222101012112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 186376 (or 186370 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 17.
Adding to 110222101012112 its reverse (211210101222011), we get a palindrome (321432202234123).
The spelling of 110222101012112 in words is "one hundred ten trillion, two hundred twenty-two billion, one hundred one million, twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •