Search a number
-
+
1377303215681 is a prime number
BaseRepresentation
bin10100000010101101101…
…010110011111001000001
311212200001121222200121102
4110002231222303321001
5140031204110400211
62532420243504145
7201335600112131
oct24025552637101
94780047880542
101377303215681
114911248392a8
121a2b20088055
139cb57600393
144a93a0caac1
1525c60796a3b
hex140adab3e41

1377303215681 has 2 divisors, whose sum is σ = 1377303215682. Its totient is φ = 1377303215680.

The previous prime is 1377303215677. The next prime is 1377303215737. The reversal of 1377303215681 is 1865123037731.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1336067821456 + 41235394225 = 1155884^2 + 203065^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1377303215681 - 22 = 1377303215677 is a prime.

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

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

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

Almost surely, 21377303215681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 635040, while the sum is 47.

The spelling of 1377303215681 in words is "one trillion, three hundred seventy-seven billion, three hundred three million, two hundred fifteen thousand, six hundred eighty-one".