Base | Representation |
---|---|
bin | 10000001011110100111… |
… | …101000001100000010001 |
3 | 10221022210220121000001001 |
4 | 100023310331001200101 |
5 | 121210302031400032 |
6 | 2210535345542001 |
7 | 143232426133531 |
oct | 20136475014021 |
9 | 3838726530031 |
10 | 1112211200017 |
11 | 399760255335 |
12 | 15b679344901 |
13 | 80b5b918c08 |
14 | 3bb8d1814c1 |
15 | 1dde7a3e3e7 |
hex | 102f4f41811 |
1112211200017 has 2 divisors, whose sum is σ = 1112211200018. Its totient is φ = 1112211200016.
The previous prime is 1112211199997. The next prime is 1112211200027. The reversal of 1112211200017 is 7100021122111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 753630598161 + 358580601856 = 868119^2 + 598816^2 .
It is an emirp because it is prime and its reverse (7100021122111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1112211200017 - 211 = 1112211197969 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1112211199967 and 1112211200003.
It is not a weakly prime, because it can be changed into another prime (1112211200027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556105600008 + 556105600009.
It is an arithmetic number, because the mean of its divisors is an integer number (556105600009).
Almost surely, 21112211200017 is an apocalyptic number.
It is an amenable number.
1112211200017 is a deficient number, since it is larger than the sum of its proper divisors (1).
1112211200017 is an equidigital number, since it uses as much as digits as its factorization.
1112211200017 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 56, while the sum is 19.
Adding to 1112211200017 its reverse (7100021122111), we get a palindrome (8212232322128).
The spelling of 1112211200017 in words is "one trillion, one hundred twelve billion, two hundred eleven million, two hundred thousand, seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •