Search a number
-
+
351055150409 is a prime number
BaseRepresentation
bin1010001101111001000…
…01000111110101001001
31020120010122012101121202
411012330201013311021
521222430104303114
6425134510113545
734235321354345
oct5067441076511
91216118171552
10351055150409
11125977531487
12580537ab8b5
1327148378292
1412dc3a58625
1591e99cacde
hex51bc847d49

351055150409 has 2 divisors, whose sum is σ = 351055150410. Its totient is φ = 351055150408.

The previous prime is 351055150363. The next prime is 351055150417. The reversal of 351055150409 is 904051550153.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 340828278025 + 10226872384 = 583805^2 + 101128^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 351055150409 - 220 = 351054101833 is a prime.

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

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

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

Almost surely, 2351055150409 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 351055150409 in words is "three hundred fifty-one billion, fifty-five million, one hundred fifty thousand, four hundred nine".