Search a number
-
+
42859437694013 is a prime number
BaseRepresentation
bin10011011111010111111011…
…00011110001110000111101
312121202022200220102022012202
421233223331203301300331
521104202112022202023
6231053204233441245
712012330551314343
oct1157537543616075
9177668626368182
1042859437694013
1112724649264916
124982542b70225
131abb820ba6b35
14a8259d20d993
154e4d141ba128
hex26fafd8f1c3d

42859437694013 has 2 divisors, whose sum is σ = 42859437694014. Its totient is φ = 42859437694012.

The previous prime is 42859437693997. The next prime is 42859437694079. The reversal of 42859437694013 is 31049673495824.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 36365084940409 + 6494352753604 = 6030347^2 + 2548402^2 .

It is a cyclic number.

It is not a de Polignac number, because 42859437694013 - 24 = 42859437693997 is a prime.

It is a congruent number.

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

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

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

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

It is a 1-persistent number, because it is pandigital, but 2⋅42859437694013 = 85718875388026 is not.

Almost surely, 242859437694013 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 156764160, while the sum is 65.

The spelling of 42859437694013 in words is "forty-two trillion, eight hundred fifty-nine billion, four hundred thirty-seven million, six hundred ninety-four thousand, thirteen".