Search a number
-
+
57145435001 is a prime number
BaseRepresentation
bin110101001110001000…
…100010001101111001
312110111120012212201122
4311032020202031321
51414013212410001
642130252555025
74062055116524
oct651610421571
9173446185648
1057145435001
1122265121136
12b0a9a82a75
135509236a85
142aa1707bbb
151746d3ab1b
hexd4e222379

57145435001 has 2 divisors, whose sum is σ = 57145435002. Its totient is φ = 57145435000.

The previous prime is 57145434991. The next prime is 57145435003. The reversal of 57145435001 is 10053454175.

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., 56085606976 + 1059828025 = 236824^2 + 32555^2 .

It is a cyclic number.

It is not a de Polignac number, because 57145435001 - 210 = 57145433977 is a prime.

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

Together with 57145435003, it forms a pair of twin primes.

It is a Chen prime.

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

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

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

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

Almost surely, 257145435001 is an apocalyptic number.

It is an amenable number.

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

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

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

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

Adding to 57145435001 its reverse (10053454175), we get a palindrome (67198889176).

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