Search a number
-
+
1434871069 is a prime number
BaseRepresentation
bin101010110000110…
…0110010100011101
310200222222000001221
41111201212110131
510414311333234
6354214133341
750362126402
oct12541462435
93628860057
101434871069
11676a46965
12340651251
1319b36a948
14d87cc2a9
1585e81eb4
hex5586651d

1434871069 has 2 divisors, whose sum is σ = 1434871070. Its totient is φ = 1434871068.

The previous prime is 1434871027. The next prime is 1434871073. The reversal of 1434871069 is 9601784341.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1094948100 + 339922969 = 33090^2 + 18437^2 .

It is an emirp because it is prime and its reverse (9601784341) is a distict prime.

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

Almost surely, 21434871069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1434871069 is about 37879.6920394029. The cubic root of 1434871069 is about 1127.9009428485.

The spelling of 1434871069 in words is "one billion, four hundred thirty-four million, eight hundred seventy-one thousand, sixty-nine".