Base | Representation |
---|---|
bin | 10000010011001011110… |
… | …101001101010110010000 |
3 | 10222002012110212121021220 |
4 | 100103023311031112100 |
5 | 121322441433020422 |
6 | 2214323314445040 |
7 | 143632254164223 |
oct | 20231365152620 |
9 | 3862173777256 |
10 | 1120111220112 |
11 | 3a2044645365 |
12 | 161102b93780 |
13 | 8181a524711 |
14 | 3c2dc4615ba |
15 | 1e20b38ae5c |
hex | 104cbd4d590 |
1120111220112 has 40 divisors (see below), whose sum is σ = 2893974163680. Its totient is φ = 373324792320.
The previous prime is 1120111220089. The next prime is 1120111220119. The reversal of 1120111220112 is 2110221110211.
It is a happy number.
It is a junction number, because it is equal to n+sod(n) for n = 1120111220091 and 1120111220100.
It is not an unprimeable number, because it can be changed into a prime (1120111220119) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1027314 + ... + 1815377.
It is an arithmetic number, because the mean of its divisors is an integer number (72349354092).
Almost surely, 21120111220112 is an apocalyptic number.
1120111220112 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1120111220112 is an abundant number, since it is smaller than the sum of its proper divisors (1773862943568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1120111220112 is a wasteful number, since it uses less digits than its factorization.
1120111220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2850911 (or 2850905 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 1120111220112 its reverse (2110221110211), we get a palindrome (3230332330323).
The spelling of 1120111220112 in words is "one trillion, one hundred twenty billion, one hundred eleven million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •