Search a number
-
+
40159949712913 is a prime number
BaseRepresentation
bin10010010000110011101111…
…00010010110111000010001
312021012020211221112022101201
421020121313202112320101
520230440034111303123
6221225120505431201
711313313664135242
oct1110316742267021
9167166757468351
1040159949712913
1111883814710858
124607325a9b501
1319540b42a83c4
149cba7545ccc9
154999bc0745ad
hex248677896e11

40159949712913 has 2 divisors, whose sum is σ = 40159949712914. Its totient is φ = 40159949712912.

The previous prime is 40159949712881. The next prime is 40159949712919. The reversal of 40159949712913 is 31921794995104.

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., 34751873885184 + 5408075827729 = 5895072^2 + 2325527^2 .

It is a cyclic number.

It is not a de Polignac number, because 40159949712913 - 25 = 40159949712881 is a prime.

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

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

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

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

Almost surely, 240159949712913 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 22044960, while the sum is 64.

The spelling of 40159949712913 in words is "forty trillion, one hundred fifty-nine billion, nine hundred forty-nine million, seven hundred twelve thousand, nine hundred thirteen".