Search a number
-
+
1019685913 is a prime number
BaseRepresentation
bin111100110001110…
…010110000011001
32122001201102002221
4330301302300121
54042014422123
6245103224041
734161121141
oct7461626031
92561642087
101019685913
1148364a134
122455a8021
1313334065c
14995d3921
155e7be25d
hex3cc72c19

1019685913 has 2 divisors, whose sum is σ = 1019685914. Its totient is φ = 1019685912.

The previous prime is 1019685871. The next prime is 1019685917. The reversal of 1019685913 is 3195869101.

1019685913 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 825585289 + 194100624 = 28733^2 + 13932^2 .

It is a cyclic number.

It is not a de Polignac number, because 1019685913 - 217 = 1019554841 is a prime.

It is a super-2 number, since 2×10196859132 = 2079518722341287138, which contains 22 as substring.

It is a self number, because there is not a number n which added to its sum of digits gives 1019685913.

It is not a weakly prime, because it can be changed into another prime (1019685917) by changing a digit.

It is a polite number, since it can be written as a sum of consecutive naturals, namely, 509842956 + 509842957.

It is an arithmetic number, because the mean of its divisors is an integer number (509842957).

Almost surely, 21019685913 is an apocalyptic number.

It is an amenable number.

1019685913 is a deficient number, since it is larger than the sum of its proper divisors (1).

1019685913 is an equidigital number, since it uses as much as digits as its factorization.

1019685913 is an odious number, because the sum of its binary digits is odd.

The product of its (nonzero) digits is 58320, while the sum is 43.

The square root of 1019685913 is about 31932.5212440233. The cubic root of 1019685913 is about 1006.5193763690.

The spelling of 1019685913 in words is "one billion, nineteen million, six hundred eighty-five thousand, nine hundred thirteen".