Base | Representation |
---|---|
bin | 10000010100000111011… |
… | …111101100101001010101 |
3 | 10222011210020102100220100 |
4 | 100110013133230221111 |
5 | 121332014211322401 |
6 | 2215010513324313 |
7 | 143666130405105 |
oct | 20240737545125 |
9 | 3864706370810 |
10 | 1121112214101 |
11 | 3a2508687a20 |
12 | 161342266699 |
13 | 81949a1c159 |
14 | 3c39538b205 |
15 | 1e2691b6b86 |
hex | 105077eca55 |
1121112214101 has 48 divisors (see below), whose sum is σ = 1775372122368. Its totient is φ = 676095120000.
The previous prime is 1121112214087. The next prime is 1121112214127. The reversal of 1121112214101 is 1014122111211.
1121112214101 is a `hidden beast` number, since 1 + 1 + 21 + 11 + 221 + 410 + 1 = 666.
It is not a de Polignac number, because 1121112214101 - 26 = 1121112214037 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1121112214501) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 20567455 + ... + 20621891.
It is an arithmetic number, because the mean of its divisors is an integer number (36986919216).
Almost surely, 21121112214101 is an apocalyptic number.
1121112214101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1121112214101 is a deficient number, since it is larger than the sum of its proper divisors (654259908267).
1121112214101 is a wasteful number, since it uses less digits than its factorization.
1121112214101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55482 (or 55479 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 18.
Adding to 1121112214101 its reverse (1014122111211), we get a palindrome (2135234325312).
The spelling of 1121112214101 in words is "one trillion, one hundred twenty-one billion, one hundred twelve million, two hundred fourteen thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •