Base | Representation |
---|---|
bin | 100001010110100… |
… | …0101111000111101 |
3 | 2212222211000201122 |
4 | 1002231011320331 |
5 | 4242443214421 |
6 | 303014320325 |
7 | 36506223242 |
oct | 10255057075 |
9 | 2788730648 |
10 | 1119116861 |
11 | 524792075 |
12 | 2729590a5 |
13 | 14ab15135 |
14 | a88b75c9 |
15 | 683b02ab |
hex | 42b45e3d |
1119116861 has 2 divisors, whose sum is σ = 1119116862. Its totient is φ = 1119116860.
The previous prime is 1119116821. The next prime is 1119116863. The reversal of 1119116861 is 1686119111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1034587225 + 84529636 = 32165^2 + 9194^2 .
It is an emirp because it is prime and its reverse (1686119111) is a distict prime. It is also a bemirp because it and its reverse can be mirrored producing other two distinct primes, 1989116111 and 1116119891.
It is a cyclic number.
It is not a de Polignac number, because 1119116861 - 218 = 1118854717 is a prime.
Together with 1119116863, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1119116863) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 559558430 + 559558431.
It is an arithmetic number, because the mean of its divisors is an integer number (559558431).
Almost surely, 21119116861 is an apocalyptic number.
It is an amenable number.
1119116861 is a deficient number, since it is larger than the sum of its proper divisors (1).
1119116861 is an equidigital number, since it uses as much as digits as its factorization.
1119116861 is an evil number, because the sum of its binary digits is even.
The product of its digits is 2592, while the sum is 35.
The square root of 1119116861 is about 33453.2040468473. The cubic root of 1119116861 is about 1038.2257906157.
The spelling of 1119116861 in words is "one billion, one hundred nineteen million, one hundred sixteen thousand, eight hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •