Search a number
-
+
532313015537 is a prime number
BaseRepresentation
bin1111011111100000101…
…01000000010011110001
31212212222210211222102202
413233300111000103301
532210134112444122
61044312523152545
753313132655622
oct7576025002361
91785883758382
10532313015537
11195830902316
12871ba675755
133b273794304
141ba9a927a49
15dca784ee92
hex7bf05404f1

532313015537 has 2 divisors, whose sum is σ = 532313015538. Its totient is φ = 532313015536.

The previous prime is 532313015513. The next prime is 532313015567. The reversal of 532313015537 is 735510313235.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 509944522816 + 22368492721 = 714104^2 + 149561^2 .

It is a cyclic number.

It is not a de Polignac number, because 532313015537 - 212 = 532313011441 is a prime.

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

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

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

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

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

Almost surely, 2532313015537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 141750, while the sum is 38.

The spelling of 532313015537 in words is "five hundred thirty-two billion, three hundred thirteen million, fifteen thousand, five hundred thirty-seven".