Search a number
-
+
531115051351447 is a prime number
BaseRepresentation
bin111100011000010111101101…
…1111110000111110110010111
32120122112002210010010001021101
41320300233123332013312113
51024103242111121221242
65121330515233130531
7216604540042554553
oct17060573376076627
92518462703101241
10531115051351447
111442586a038aa42
124b6997a40b9a47
1319a47c1bc66804
149522169c60863
1541607c47329b7
hex1e30bdbf87d97

531115051351447 has 2 divisors, whose sum is σ = 531115051351448. Its totient is φ = 531115051351446.

The previous prime is 531115051351427. The next prime is 531115051351529. The reversal of 531115051351447 is 744153150511135.

It is a weak prime.

It is a cyclic number.

It is not a de Polignac number, because 531115051351447 - 223 = 531115042962839 is a prime.

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

It is a junction number, because it is equal to n+sod(n) for n = 531115051351397 and 531115051351406.

It is a congruent number.

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

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

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

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

Almost surely, 2531115051351447 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 630000, while the sum is 46.

The spelling of 531115051351447 in words is "five hundred thirty-one trillion, one hundred fifteen billion, fifty-one million, three hundred fifty-one thousand, four hundred forty-seven".