Base | Representation |
---|---|
bin | 10000001011110101011… |
… | …110101011000110000001 |
3 | 10221022211112012011022121 |
4 | 100023311132223012001 |
5 | 121210311311133441 |
6 | 2210540303004241 |
7 | 143232564123166 |
oct | 20136536530601 |
9 | 3838745164277 |
10 | 1112220021121 |
11 | 39976522a800 |
12 | 15b680299681 |
13 | 80b606b6cc1 |
14 | 3bb903da06d |
15 | 1dde86d2dd1 |
hex | 102f57ab181 |
1112220021121 has 12 divisors (see below), whose sum is σ = 1228005028096. Its totient is φ = 1006574964120.
The previous prime is 1112220021103. The next prime is 1112220021137. The reversal of 1112220021121 is 1211200222111.
It is not a de Polignac number, because 1112220021121 - 215 = 1112219988353 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112220021095 and 1112220021104.
It is not an unprimeable number, because it can be changed into a prime (1112220021421) 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 11 ways as a sum of consecutive naturals, for example, 20582661 + ... + 20636626.
Almost surely, 21112220021121 is an apocalyptic number.
1112220021121 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1112220021121 is a deficient number, since it is larger than the sum of its proper divisors (115785006975).
1112220021121 is a wasteful number, since it uses less digits than its factorization.
1112220021121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 41219532 (or 41219521 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 1112220021121 its reverse (1211200222111), we get a palindrome (2323420243232).
The spelling of 1112220021121 in words is "one trillion, one hundred twelve billion, two hundred twenty million, twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •