Search a number
-
+
1040151569 is a prime number
BaseRepresentation
bin111101111111110…
…111010000010001
32200111020011201012
4331333313100101
54112234322234
6251114020305
734530066602
oct7577672021
92614204635
101040151569
114941582a6
12250417695
13137657a02
149c1ddda9
15614b30ce
hex3dff7411

1040151569 has 2 divisors, whose sum is σ = 1040151570. Its totient is φ = 1040151568.

The previous prime is 1040151551. The next prime is 1040151589. The reversal of 1040151569 is 9651510401.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 991431169 + 48720400 = 31487^2 + 6980^2 .

It is a cyclic number.

It is not a de Polignac number, because 1040151569 - 212 = 1040147473 is a prime.

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

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

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

Almost surely, 21040151569 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 5400, while the sum is 32.

The square root of 1040151569 is about 32251.3808851652. The cubic root of 1040151569 is about 1013.2086205183.

The spelling of 1040151569 in words is "one billion, forty million, one hundred fifty-one thousand, five hundred sixty-nine".