Search a number
-
+
1047952069 is a prime number
BaseRepresentation
bin111110011101100…
…111101011000101
32201000220110222121
4332131213223011
54121233431234
6251553125541
734653305563
oct7635475305
92630813877
101047952069
114985a599a
12252b598b1
131391593a8
149d270a33
15620044b4
hex3e767ac5

1047952069 has 2 divisors, whose sum is σ = 1047952070. Its totient is φ = 1047952068.

The previous prime is 1047952067. The next prime is 1047952133. The reversal of 1047952069 is 9602597401.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 646430625 + 401521444 = 25425^2 + 20038^2 .

It is a cyclic number.

It is not a de Polignac number, because 1047952069 - 21 = 1047952067 is a prime.

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

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

It is a congruent number.

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

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

Almost surely, 21047952069 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1047952069 is about 32372.0878072453. The cubic root of 1047952069 is about 1015.7351300397.

The spelling of 1047952069 in words is "one billion, forty-seven million, nine hundred fifty-two thousand, sixty-nine".