Search a number
-
+
46942132001 is a prime number
BaseRepresentation
bin101011101101111110…
…000001011100100001
311111011110220101022112
4223231332001130201
51232114141211001
633322004445105
73251161352462
oct535576013441
9144143811275
1046942132001
11189a9678616
1291209a9795
1345713a6a8b
1423b4582d69
15134b1becbb
hexaedf81721

46942132001 has 2 divisors, whose sum is σ = 46942132002. Its totient is φ = 46942132000.

The previous prime is 46942131997. The next prime is 46942132007. The reversal of 46942132001 is 10023124964.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 42900351376 + 4041780625 = 207124^2 + 63575^2 .

It is a cyclic number.

It is not a de Polignac number, because 46942132001 - 22 = 46942131997 is a prime.

It is a Sophie Germain prime.

It is a Curzon number.

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

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

Almost surely, 246942132001 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 10368, while the sum is 32.

Adding to 46942132001 its reverse (10023124964), we get a palindrome (56965256965).

The spelling of 46942132001 in words is "forty-six billion, nine hundred forty-two million, one hundred thirty-two thousand, one".