Search a number
-
+
154000861571 is a prime number
BaseRepresentation
bin1000111101101100101…
…0101010100110000011
3112201111120210100011202
42033123022222212003
510010343210032241
6154425204531415
714061166503464
oct2173312524603
9481446710152
10154000861571
115a347520717
1225a1a6b0b6b
13116a341307b
14764cc8ad6b
154014e74d9b
hex23db2aa983

154000861571 has 2 divisors, whose sum is σ = 154000861572. Its totient is φ = 154000861570.

The previous prime is 154000861517. The next prime is 154000861583. The reversal of 154000861571 is 175168000451.

154000861571 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

Together with previous prime (154000861517) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-154000861571 is a prime.

It is a super-2 number, since 2×1540008615712 (a number of 23 digits) contains 22 as substring.

It is a Sophie Germain prime.

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

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

Almost surely, 2154000861571 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 33600, while the sum is 38.

The spelling of 154000861571 in words is "one hundred fifty-four billion, eight hundred sixty-one thousand, five hundred seventy-one".