Search a number
-
+
153365404653161 is a prime number
BaseRepresentation
bin100010110111110000101010…
…011101110001011001101001
3202010000120220202001201201022
4202313300222131301121221
5130100214322042400121
61302103032205302225
744206166461260131
oct4267605235613151
9663016822051638
10153365404653161
11449599a27761a8
121524b2ab864975
1367763ac5939cc
1429c2cd4a21ac1
1512ae5bd2bdaab
hex8b7c2a771669

153365404653161 has 2 divisors, whose sum is σ = 153365404653162. Its totient is φ = 153365404653160.

The previous prime is 153365404653121. The next prime is 153365404653187. The reversal of 153365404653161 is 161356404563351.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 148118757864025 + 5246646789136 = 12170405^2 + 2290556^2 .

It is a cyclic number.

It is not a de Polignac number, because 153365404653161 - 214 = 153365404636777 is a prime.

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

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

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

Almost surely, 2153365404653161 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 11664000, while the sum is 53.

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