Search a number
-
+
31926707489741 is a prime number
BaseRepresentation
bin1110100001001100001000…
…00011110000101111001101
311012001011102010202022121012
413100212010003300233031
513141041344104132431
6151522532115215005
76503425401005321
oct720460403605715
9135034363668535
1031926707489741
11a19a04a061109
1236b77398a7465
1314a78a2399a4c
147c5391c37981
153a57485c222b
hex1d09840f0bcd

31926707489741 has 2 divisors, whose sum is σ = 31926707489742. Its totient is φ = 31926707489740.

The previous prime is 31926707489707. The next prime is 31926707489779. The reversal of 31926707489741 is 14798470762913.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 27465512970025 + 4461194519716 = 5240755^2 + 2112154^2 .

It is an emirp because it is prime and its reverse (14798470762913) is a distict prime.

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-31926707489741 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 231926707489741 is an apocalyptic number.

It is an amenable number.

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

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

31926707489741 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 128024064, while the sum is 68.

The spelling of 31926707489741 in words is "thirty-one trillion, nine hundred twenty-six billion, seven hundred seven million, four hundred eighty-nine thousand, seven hundred forty-one".