Search a number
-
+
1314046354261 is a prime number
BaseRepresentation
bin10011000111110011010…
…001000010001101010101
311122121210011001011220011
4103013303101002031111
5133012131331314021
62443355313440221
7163636202501464
oct23076321021525
94577704034804
101314046354261
11467313a01033
12192807570071
1396bb61b6174
1447858c8a9db
15242ac162de1
hex131f3442355

1314046354261 has 2 divisors, whose sum is σ = 1314046354262. Its totient is φ = 1314046354260.

The previous prime is 1314046354253. The next prime is 1314046354333. The reversal of 1314046354261 is 1624536404131.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1245721622161 + 68324732100 = 1116119^2 + 261390^2 .

It is a cyclic number.

It is not a de Polignac number, because 1314046354261 - 23 = 1314046354253 is a prime.

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

It is a congruent number.

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

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

Almost surely, 21314046354261 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 207360, while the sum is 40.

The spelling of 1314046354261 in words is "one trillion, three hundred fourteen billion, forty-six million, three hundred fifty-four thousand, two hundred sixty-one".