Search a number
-
+
1348699927681 is a prime number
BaseRepresentation
bin10011101000000100110…
…001111011010010000001
311202221020012212002220101
4103220010301323102001
5134044114140141211
62511330104042401
7166304020143001
oct23500461732201
94687205762811
101348699927681
1147aa86a48707
12199478a63401
139a2497052b2
14493c537a001
15251395b35c1
hex13a04c7b481

1348699927681 has 2 divisors, whose sum is σ = 1348699927682. Its totient is φ = 1348699927680.

The previous prime is 1348699927639. The next prime is 1348699927709. The reversal of 1348699927681 is 1867299968431.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1133511562225 + 215188365456 = 1064665^2 + 463884^2 .

It is a cyclic number.

It is not a de Polignac number, because 1348699927681 - 211 = 1348699925633 is a prime.

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

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

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

Almost surely, 21348699927681 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 282175488, while the sum is 73.

The spelling of 1348699927681 in words is "one trillion, three hundred forty-eight billion, six hundred ninety-nine million, nine hundred twenty-seven thousand, six hundred eighty-one".