Search a number
-
+
154036131133 is a prime number
BaseRepresentation
bin1000111101110101000…
…1001101010100111101
3112201121001011012220211
42033131101031110331
510010431222144013
6154432504512421
714062105340263
oct2173521152475
9481531135824
10154036131133
115a365420215
1225a2a47b711
13116aa811731
14765382c433
1540180e023d
hex23dd44d53d

154036131133 has 2 divisors, whose sum is σ = 154036131134. Its totient is φ = 154036131132.

The previous prime is 154036131131. The next prime is 154036131149. The reversal of 154036131133 is 331131630451.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 151517898009 + 2518233124 = 389253^2 + 50182^2 .

It is a cyclic number.

It is not a de Polignac number, because 154036131133 - 21 = 154036131131 is a prime.

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

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

It is a congruent number.

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

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

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

Almost surely, 2154036131133 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 9720, while the sum is 31.

Adding to 154036131133 its reverse (331131630451), we get a palindrome (485167761584).

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