Base | Representation |
---|---|
bin | 10000001011110000001… |
… | …011011110000111000111 |
3 | 10221022121022212120000111 |
4 | 100023300023132013013 |
5 | 121210121030214002 |
6 | 2210523405053451 |
7 | 143230434246214 |
oct | 20136013360707 |
9 | 3838538776014 |
10 | 1112131101127 |
11 | 39971a016902 |
12 | 15b656557287 |
13 | 80b48152817 |
14 | 3bb82690b0b |
15 | 1dde09bb3d7 |
hex | 102f02de1c7 |
1112131101127 has 2 divisors, whose sum is σ = 1112131101128. Its totient is φ = 1112131101126.
The previous prime is 1112131101101. The next prime is 1112131101161. The reversal of 1112131101127 is 7211011312111.
It is a weak prime.
It is an emirp because it is prime and its reverse (7211011312111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1112131101127 - 27 = 1112131100999 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112131101098 and 1112131101107.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112131101167) 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 as a sum of consecutive naturals, namely, 556065550563 + 556065550564.
It is an arithmetic number, because the mean of its divisors is an integer number (556065550564).
Almost surely, 21112131101127 is an apocalyptic number.
1112131101127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112131101127 is an equidigital number, since it uses as much as digits as its factorization.
1112131101127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 84, while the sum is 22.
Adding to 1112131101127 its reverse (7211011312111), we get a palindrome (8323142413238).
The spelling of 1112131101127 in words is "one trillion, one hundred twelve billion, one hundred thirty-one million, one hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •