Search a number
-
+
153330523013071 is a prime number
BaseRepresentation
bin100010110111010000001011…
…010110110111111111001111
3202002220020212210002211001101
4202313100023112313333033
5130044131402342404241
61302035023030523531
744203523204234335
oct4267201326677717
9662806783084041
10153330523013071
1144946122a16778
1215244595b065a7
136773010a415a1
1429c1346125b55
1512ad72ad1ce31
hex8b740b5b7fcf

153330523013071 has 2 divisors, whose sum is σ = 153330523013072. Its totient is φ = 153330523013070.

The previous prime is 153330523013039. The next prime is 153330523013149. The reversal of 153330523013071 is 170310325033351.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 153330523013071 - 25 = 153330523013039 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 153330523013071.

It is a congruent number.

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

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

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

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

Almost surely, 2153330523013071 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 85050, while the sum is 37.

The spelling of 153330523013071 in words is "one hundred fifty-three trillion, three hundred thirty billion, five hundred twenty-three million, thirteen thousand, seventy-one".