Base | Representation |
---|---|
bin | 11001011111010011001001… |
… | …000101100011011101111100 |
3 | 112200220211220112012210022220 |
4 | 121133103021011203131330 |
5 | 104143134414121231022 |
6 | 1034230542421405340 |
7 | 32420050363550433 |
oct | 3137231105433574 |
9 | 480824815183286 |
10 | 112102020102012 |
11 | 327a0221943676 |
12 | 106a6157869850 |
13 | 4a72237a0a2a5 |
14 | 1d97aa3c6011a |
15 | ce606de5d85c |
hex | 65f4c916377c |
112102020102012 has 96 divisors (see below), whose sum is σ = 264859564569600. Its totient is φ = 36899802035712.
The previous prime is 112102020101993. The next prime is 112102020102073. The reversal of 112102020102012 is 210201020201211.
It is a junction number, because it is equal to n+sod(n) for n = 112102020101982 and 112102020102000.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 632116689 + ... + 632294007.
It is an arithmetic number, because the mean of its divisors is an integer number (2758953797600).
Almost surely, 2112102020102012 is an apocalyptic number.
112102020102012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
112102020102012 is an abundant number, since it is smaller than the sum of its proper divisors (152757544467588).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
112102020102012 is a wasteful number, since it uses less digits than its factorization.
112102020102012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 178875 (or 178873 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 112102020102012 its reverse (210201020201211), we get a palindrome (322303040303223).
The spelling of 112102020102012 in words is "one hundred twelve trillion, one hundred two billion, twenty million, one hundred two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •