Search a number
-
+
313367144669 is a prime number
BaseRepresentation
bin1001000111101100010…
…00110010100011011101
31002221212002120100000022
410203312020302203131
520113233442112134
6355543041241525
731432346531525
oct4436610624335
91087762510008
10313367144669
111109976469a7
12508960332a5
13237202aa377
141124a55c685
158240e8452e
hex48f62328dd

313367144669 has 2 divisors, whose sum is σ = 313367144670. Its totient is φ = 313367144668.

The previous prime is 313367144663. The next prime is 313367144707. The reversal of 313367144669 is 966441763313.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 196615088569 + 116752056100 = 443413^2 + 341690^2 .

It is a cyclic number.

It is not a de Polignac number, because 313367144669 - 24 = 313367144653 is a prime.

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

It is a self number, because there is not a number n which added to its sum of digits gives 313367144669.

It is a congruent number.

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

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

Almost surely, 2313367144669 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 5878656, while the sum is 53.

The spelling of 313367144669 in words is "three hundred thirteen billion, three hundred sixty-seven million, one hundred forty-four thousand, six hundred sixty-nine".