Base | Representation |
---|---|
bin | 10000001010110011010… |
… | …101000101100110011101 |
3 | 10221012222011220000101222 |
4 | 100022303111011212131 |
5 | 121201023203240442 |
6 | 2210234215543125 |
7 | 143163226654112 |
oct | 20126325054635 |
9 | 3835864800358 |
10 | 1111110211997 |
11 | 399245825785 |
12 | 15b41068aaa5 |
13 | 80a147b0606 |
14 | 3bac6c66909 |
15 | 1dd810608d2 |
hex | 102b354599d |
1111110211997 has 2 divisors, whose sum is σ = 1111110211998. Its totient is φ = 1111110211996.
The previous prime is 1111110211987. The next prime is 1111110212057. The reversal of 1111110211997 is 7991120111111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1026278406916 + 84831805081 = 1013054^2 + 291259^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1111110211997 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111110211957) 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, 555555105998 + 555555105999.
It is an arithmetic number, because the mean of its divisors is an integer number (555555105999).
Almost surely, 21111110211997 is an apocalyptic number.
It is an amenable number.
1111110211997 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111110211997 is an equidigital number, since it uses as much as digits as its factorization.
1111110211997 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 35.
The spelling of 1111110211997 in words is "one trillion, one hundred eleven billion, one hundred ten million, two hundred eleven thousand, nine hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •