Search a number
-
+
531693448150913 is a prime number
BaseRepresentation
bin111100011100100101000011…
…1000110110011111110000001
32120201120101201120201210211022
41320321022013012303332001
51024142231140211312123
65122452333103555225
7216664404205335626
oct17071120706637601
92521511646653738
10531693448150913
11144460a1a2971a4
124b771903bbbb15
1319a8a628032909
149542158d3434d
154170877c021c8
hex1e392871b3f81

531693448150913 has 2 divisors, whose sum is σ = 531693448150914. Its totient is φ = 531693448150912.

The previous prime is 531693448150867. The next prime is 531693448151123. The reversal of 531693448150913 is 319051844396135.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 525515598712129 + 6177849438784 = 22924127^2 + 2485528^2 .

It is a cyclic number.

It is not a de Polignac number, because 531693448150913 - 210 = 531693448149889 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

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

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

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

Almost surely, 2531693448150913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 41990400, while the sum is 62.

The spelling of 531693448150913 in words is "five hundred thirty-one trillion, six hundred ninety-three billion, four hundred forty-eight million, one hundred fifty thousand, nine hundred thirteen".