Base | Representation |
---|---|
bin | 11001011101110111000001… |
… | …100110010110010000011000 |
3 | 112200120101121022211211211010 |
4 | 121131313001212112100120 |
5 | 104140024332204424422 |
6 | 1034113303555533520 |
7 | 32406646324542630 |
oct | 3135670146262030 |
9 | 480511538754733 |
10 | 112003110233112 |
11 | 327622858a216a |
12 | 1068ab52bba2a0 |
13 | 4a65b04004547 |
14 | 1d92d9d8cd6c0 |
15 | ce36d07aab0c |
hex | 65ddc1996418 |
112003110233112 has 32 divisors (see below), whose sum is σ = 320008886380800. Its totient is φ = 32000888637984.
The previous prime is 112003110233071. The next prime is 112003110233141. The reversal of 112003110233112 is 211332011300211.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 333342589812 + ... + 333342590147.
It is an arithmetic number, because the mean of its divisors is an integer number (10000277699400).
Almost surely, 2112003110233112 is an apocalyptic number.
112003110233112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112003110233112 is an abundant number, since it is smaller than the sum of its proper divisors (208005776147688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112003110233112 is a wasteful number, since it uses less digits than its factorization.
112003110233112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 666685179975 (or 666685179971 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 21.
Adding to 112003110233112 its reverse (211332011300211), we get a palindrome (323335121533323).
The spelling of 112003110233112 in words is "one hundred twelve trillion, three billion, one hundred ten million, two hundred thirty-three thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •