Base | Representation |
---|---|
bin | 10000001011101000011… |
… | …011100100000011110111 |
3 | 10221022021021020220211122 |
4 | 100023220123210003313 |
5 | 121204334240231241 |
6 | 2210502442454155 |
7 | 143224265261216 |
oct | 20135033440367 |
9 | 3838237226748 |
10 | 1112001102071 |
11 | 3996626a5672 |
12 | 15b61ab0435b |
13 | 80b272375c2 |
14 | 3bb6d2d107d |
15 | 1ddd438d04b |
hex | 102e86e40f7 |
1112001102071 has 2 divisors, whose sum is σ = 1112001102072. Its totient is φ = 1112001102070.
The previous prime is 1112001101983. The next prime is 1112001102097. The reversal of 1112001102071 is 1702011002111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1112001102071 - 214 = 1112001085687 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1112001102271) 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, 556000551035 + 556000551036.
It is an arithmetic number, because the mean of its divisors is an integer number (556000551036).
Almost surely, 21112001102071 is an apocalyptic number.
1112001102071 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112001102071 is an equidigital number, since it uses as much as digits as its factorization.
1112001102071 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 17.
Adding to 1112001102071 its reverse (1702011002111), we get a palindrome (2814012104182).
The spelling of 1112001102071 in words is "one trillion, one hundred twelve billion, one million, one hundred two thousand, seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.187 sec. • engine limits •