Search a number
-
+
1151200271471 is a prime number
BaseRepresentation
bin10000110000001000111…
…000100001110001101111
311002001110010102001021112
4100300020320201301233
5122330124232141341
62240504253022235
7146112546566015
oct20601070416157
94061403361245
101151200271471
114042485a5838
1216713a78497b
1384733405bb3
143da0b3988b5
151ee2a8d6aeb
hex10c08e21c6f

1151200271471 has 2 divisors, whose sum is σ = 1151200271472. Its totient is φ = 1151200271470.

The previous prime is 1151200271371. The next prime is 1151200271483. The reversal of 1151200271471 is 1741720021511.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 1151200271471 - 210 = 1151200270447 is a prime.

It is a super-3 number, since 3×11512002714713 (a number of 37 digits) contains 333 as substring.

It is a Sophie Germain prime.

It is a congruent number.

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

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

Almost surely, 21151200271471 is an apocalyptic number.

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

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

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

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

Adding to 1151200271471 its reverse (1741720021511), we get a palindrome (2892920292982).

The spelling of 1151200271471 in words is "one trillion, one hundred fifty-one billion, two hundred million, two hundred seventy-one thousand, four hundred seventy-one".