Search a number
-
+
1513210019 is a prime number
BaseRepresentation
bin101101000110001…
…1100000010100011
310220110101000220112
41122030130002203
511044340210034
6410053201535
752333034006
oct13214340243
93813330815
101513210019
117071930a2
123629302ab
131b1668c59
14104d8153d
158cca87ce
hex5a31c0a3

1513210019 has 2 divisors, whose sum is σ = 1513210020. Its totient is φ = 1513210018.

The previous prime is 1513209959. The next prime is 1513210031. The reversal of 1513210019 is 9100123151.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1513210019 is a prime.

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

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 1513209976 and 1513210003.

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

It is a pernicious number, because its binary representation contains a prime number (13) of ones.

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

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

Almost surely, 21513210019 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 270, while the sum is 23.

The square root of 1513210019 is about 38900.0002442159. Note that the first 3 decimals coincide. The cubic root of 1513210019 is about 1148.0648030349.

The spelling of 1513210019 in words is "one billion, five hundred thirteen million, two hundred ten thousand, nineteen".