Search a number
-
+
1047607019 is a prime number
BaseRepresentation
bin111110011100010…
…011011011101011
32201000020221122222
4332130103123223
54121141411034
6251541504255
734650340604
oct7634233353
92630227588
101047607019
1149838a728
12252a1208b
13139068314
149d1c0dab
1561e8712e
hex3e7136eb

1047607019 has 2 divisors, whose sum is σ = 1047607020. Its totient is φ = 1047607018.

The previous prime is 1047606977. The next prime is 1047607021. The reversal of 1047607019 is 9107067401.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1047607019 - 212 = 1047602923 is a prime.

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

Together with 1047607021, it forms a pair of twin primes.

It is a Chen prime.

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

It is not a weakly prime, because it can be changed into another prime (1047607039) 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, 523803509 + 523803510.

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

Almost surely, 21047607019 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 10584, while the sum is 35.

The square root of 1047607019 is about 32366.7579315569. The cubic root of 1047607019 is about 1015.6236370652.

The spelling of 1047607019 in words is "one billion, forty-seven million, six hundred seven thousand, nineteen".