Search a number
-
+
1156476131 is a prime number
BaseRepresentation
bin100010011101110…
…0110110011100011
32222121010002000022
41010323212303203
54332024214011
6310431144055
740441612346
oct10473466343
92877102008
101156476131
115438896a8
1228337502b
13155795a05
14ad84045d
156b7de8db
hex44ee6ce3

1156476131 has 2 divisors, whose sum is σ = 1156476132. Its totient is φ = 1156476130.

The previous prime is 1156476103. The next prime is 1156476149. The reversal of 1156476131 is 1316746511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1156476131 - 226 = 1089367267 is a prime.

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

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 1156476091 and 1156476100.

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

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

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

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

Almost surely, 21156476131 is an apocalyptic number.

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

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

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

The product of its digits is 15120, while the sum is 35.

The square root of 1156476131 is about 34007.0012056341. The cubic root of 1156476131 is about 1049.6525323448.

The spelling of 1156476131 in words is "one billion, one hundred fifty-six million, four hundred seventy-six thousand, one hundred thirty-one".