Search a number
-
+
230310323010953 is a prime number
BaseRepresentation
bin110100010111011101001100…
…111111011011110110001001
31010012110110012101211010122122
4310113131030333123312021
5220141401020142322303
62133455033551501025
766340241335050263
oct6427351477336611
91105413171733578
10230310323010953
1167425072186609
12219b7825227775
139b6822a110a23
1440c3117118b33
151b95d7793be38
hexd1774cfdbd89

230310323010953 has 2 divisors, whose sum is σ = 230310323010954. Its totient is φ = 230310323010952.

The previous prime is 230310323010907. The next prime is 230310323010979. The reversal of 230310323010953 is 359010323013032.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 229547710292224 + 762612718729 = 15150832^2 + 873277^2 .

It is a cyclic number.

It is not a de Polignac number, because 230310323010953 - 230 = 230309249269129 is a prime.

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

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

Almost surely, 2230310323010953 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 43740, while the sum is 35.

Adding to 230310323010953 its reverse (359010323013032), we get a palindrome (589320646023985).

The spelling of 230310323010953 in words is "two hundred thirty trillion, three hundred ten billion, three hundred twenty-three million, ten thousand, nine hundred fifty-three".