Search a number
-
+
1150403561 is a prime number
BaseRepresentation
bin100010010010001…
…1100001111101001
32222011200120000022
41010210130033221
54324000403221
6310053050225
740336161146
oct10444341751
92864616008
101150403561
1154041124a
12281326975
1315444a988
14acadd3cd
156aee04ab
hex4491c3e9

1150403561 has 2 divisors, whose sum is σ = 1150403562. Its totient is φ = 1150403560.

The previous prime is 1150403533. The next prime is 1150403563. The reversal of 1150403561 is 1653040511.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1072169536 + 78234025 = 32744^2 + 8845^2 .

It is a cyclic number.

It is not a de Polignac number, because 1150403561 - 26 = 1150403497 is a prime.

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

It is a Sophie Germain prime.

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

It is a Chen prime.

It is a Curzon number.

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

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

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

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

Almost surely, 21150403561 is an apocalyptic number.

It is an amenable number.

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

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

1150403561 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 1800, while the sum is 26.

The square root of 1150403561 is about 33917.5995760313. The cubic root of 1150403561 is about 1047.8120914893.

The spelling of 1150403561 in words is "one billion, one hundred fifty million, four hundred three thousand, five hundred sixty-one".