Search a number
-
+
1531505661167 is a prime number
BaseRepresentation
bin10110010010010100110…
…110011101010011101111
312102102002021002112221002
4112102110312131103233
5200043010422124132
63131321453230515
7215435065221056
oct26222466352357
95372067075832
101531505661167
11540565023999
1220899619243b
13b1560703671
14541a7a4d39d
1529c8828a262
hex16494d9d4ef

1531505661167 has 2 divisors, whose sum is σ = 1531505661168. Its totient is φ = 1531505661166.

The previous prime is 1531505661097. The next prime is 1531505661181. The reversal of 1531505661167 is 7611665051351.

It is a strong prime.

It is an emirp because it is prime and its reverse (7611665051351) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1531505661167 is a prime.

It is a super-3 number, since 3×15315056611673 (a number of 38 digits) contains 333 as substring.

It is a congruent number.

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

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

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

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

Almost surely, 21531505661167 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 567000, while the sum is 47.

The spelling of 1531505661167 in words is "one trillion, five hundred thirty-one billion, five hundred five million, six hundred sixty-one thousand, one hundred sixty-seven".