Base | Representation |
---|---|
bin | 10000001011101110111… |
… | …100001100100110001100 |
3 | 10221022112212202202200120 |
4 | 100023232330030212030 |
5 | 121210100220220022 |
6 | 2210521343424540 |
7 | 143230062514656 |
oct | 20135674144614 |
9 | 3838485682616 |
10 | 1112110320012 |
11 | 39970931272a |
12 | 15b64b5b5150 |
13 | 80b43a579c3 |
14 | 3bb7da016d6 |
15 | 1ddddc63d5c |
hex | 102eef0c98c |
1112110320012 has 48 divisors (see below), whose sum is σ = 2751026783232. Its totient is φ = 349049442240.
The previous prime is 1112110320001. The next prime is 1112110320029. The reversal of 1112110320012 is 2100230112111.
It is a junction number, because it is equal to n+sod(n) for n = 1112110319973 and 1112110320000.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 40385478 + ... + 40413005.
It is an arithmetic number, because the mean of its divisors is an integer number (57313057984).
Almost surely, 21112110320012 is an apocalyptic number.
1112110320012 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1112110320012 is an abundant number, since it is smaller than the sum of its proper divisors (1638916463220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1112110320012 is a wasteful number, since it uses less digits than its factorization.
1112110320012 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80798558 (or 80798556 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 15.
Adding to 1112110320012 its reverse (2100230112111), we get a palindrome (3212340432123).
The spelling of 1112110320012 in words is "one trillion, one hundred twelve billion, one hundred ten million, three hundred twenty thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •