Search a number
-
+
46540424257 is a prime number
BaseRepresentation
bin101011010110000001…
…101000010001000001
311110010111000111212221
4223112001220101001
51230303322034012
633214054451041
73235213036045
oct532601502101
9143114014787
1046540424257
1118812946648
12902a363a81
1345090b80a2
142377096025
151325cc0507
hexad6068441

46540424257 has 2 divisors, whose sum is σ = 46540424258. Its totient is φ = 46540424256.

The previous prime is 46540424251. The next prime is 46540424297. The reversal of 46540424257 is 75242404564.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 39702953536 + 6837470721 = 199256^2 + 82689^2 .

It is a cyclic number.

It is not a de Polignac number, because 46540424257 - 27 = 46540424129 is a prime.

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

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

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

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

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

Almost surely, 246540424257 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1075200, while the sum is 43.

The spelling of 46540424257 in words is "forty-six billion, five hundred forty million, four hundred twenty-four thousand, two hundred fifty-seven".