Search a number
-
+
315155656433731 is a prime number
BaseRepresentation
bin100011110101000011110010…
…0111100110110000001000011
31112022212120211120100002022211
41013222013210330312001003
5312302002241021334411
63034140302043242551
7123245146650556321
oct10752074474660103
91468776746302284
10315155656433731
1191466843a69573
122b41b33b819457
13106b1087a29b49
1457b7887dd6d11
152667dc6473221
hex11ea1e4f36043

315155656433731 has 2 divisors, whose sum is σ = 315155656433732. Its totient is φ = 315155656433730.

The previous prime is 315155656433701. The next prime is 315155656433819. The reversal of 315155656433731 is 137334656551513.

It is a weak prime.

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

It is a cyclic number.

It is not a de Polignac number, because 315155656433731 - 211 = 315155656431683 is a prime.

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

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

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

Almost surely, 2315155656433731 is an apocalyptic number.

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

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

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

The product of its digits is 51030000, while the sum is 58.

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