Base | Representation |
---|---|
bin | 1011000000111101110100… |
… | …0010000011110100110000 |
3 | 1120212211011211020000002001 |
4 | 2300033131002003310300 |
5 | 3041412240101041422 |
6 | 41431452420303344 |
7 | 2360002230611413 |
oct | 260173502036460 |
9 | 46784154200061 |
10 | 12111221112112 |
11 | 394a381640581 |
12 | 143729b541b54 |
13 | 69b110b93625 |
14 | 2dc287029b7a |
15 | 160092324227 |
hex | b03dd083d30 |
12111221112112 has 40 divisors (see below), whose sum is σ = 23573633936400. Its totient is φ = 6027765472512.
The previous prime is 12111221112091. The next prime is 12111221112113. The reversal of 12111221112112 is 21121112211121.
It is a nude number because it is divisible by every one of its digits.
It is a self number, because there is not a number n which added to its sum of digits gives 12111221112112.
It is not an unprimeable number, because it can be changed into a prime (12111221112113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1124658 + ... + 5048494.
It is an arithmetic number, because the mean of its divisors is an integer number (589340848410).
Almost surely, 212111221112112 is an apocalyptic number.
It is an amenable number.
12111221112112 is a deficient number, since it is larger than the sum of its proper divisors (11462412824288).
12111221112112 is a wasteful number, since it uses less digits than its factorization.
12111221112112 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3924733 (or 3924727 counting only the distinct ones).
The product of its digits is 32, while the sum is 19.
Adding to 12111221112112 its reverse (21121112211121), we get a palindrome (33232333323233).
The spelling of 12111221112112 in words is "twelve trillion, one hundred eleven billion, two hundred twenty-one million, one hundred twelve thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •