Search a number
-
+
10140561564961 is a prime number
BaseRepresentation
bin1001001110010000100010…
…0100011110010100100001
31022220102120011121120212211
42103210020210132110201
52312120332230034321
633322302031122121
72064426366053242
oct223441044362441
938812504546784
1010140561564961
11325a651704233
121179385673341
13587335179979
14270b3d17acc9
15128ba50de0e1
hex9390891e521

10140561564961 has 2 divisors, whose sum is σ = 10140561564962. Its totient is φ = 10140561564960.

The previous prime is 10140561564949. The next prime is 10140561565027. The reversal of 10140561564961 is 16946516504101.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 10091543604961 + 49017960000 = 3176719^2 + 221400^2 .

It is a cyclic number.

It is not a de Polignac number, because 10140561564961 - 241 = 7941538309409 is a prime.

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

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

Almost surely, 210140561564961 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 777600, while the sum is 49.

The spelling of 10140561564961 in words is "ten trillion, one hundred forty billion, five hundred sixty-one million, five hundred sixty-four thousand, nine hundred sixty-one".