[go: up one dir, main page]

Search a number
-
+
69070913 is a prime number
BaseRepresentation
bin1000001110111…
…11000001000001
311210222011110222
410013133001001
5120140232123
610504232425
71466043632
oct407370101
9153864428
1069070913
1135a96aaa
121b16b715
1311404982
14925d889
1560e56c8
hex41df041

69070913 has 2 divisors, whose sum is σ = 69070914. Its totient is φ = 69070912.

The previous prime is 69070891. The next prime is 69070927. The reversal of 69070913 is 31907096.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 40094224 + 28976689 = 6332^2 + 5383^2 .

It is a cyclic number.

It is not a de Polignac number, because 69070913 - 28 = 69070657 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

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

Almost surely, 269070913 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 69070913 is about 8310.8912277806. The cubic root of 69070913 is about 410.2970542080.

The spelling of 69070913 in words is "sixty-nine million, seventy thousand, nine hundred thirteen".