Search a number
-
+
350513045000711 is a prime number
BaseRepresentation
bin100111110110010100010110…
…1100010010101001000000111
31200222001201102202210021001222
41033230220231202111020013
5331420301204010010321
63241251245300310555
7133554506003601605
oct11754505542251007
91628051382707058
10350513045000711
11a175882505712a
123338b9396a245b
1312077313772298
14627acc9984875
152a7c9ae4923ab
hex13eca2d895207

350513045000711 has 2 divisors, whose sum is σ = 350513045000712. Its totient is φ = 350513045000710.

The previous prime is 350513045000659. The next prime is 350513045000743. The reversal of 350513045000711 is 117000540315053.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 350513045000711 - 210 = 350513044999687 is a prime.

It is a Sophie Germain prime.

It is a congruent number.

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

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

Almost surely, 2350513045000711 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 31500, while the sum is 35.

Adding to 350513045000711 its reverse (117000540315053), we get a palindrome (467513585315764).

The spelling of 350513045000711 in words is "three hundred fifty trillion, five hundred thirteen billion, forty-five million, seven hundred eleven", and thus it is an aban number.