Search a number
-
+
1406313073751 is a prime number
BaseRepresentation
bin10100011101101110110…
…010101000110001010111
311222102221101011011121012
4110131232302220301113
5141020112121330001
62554015025442435
7203413514615615
oct24355662506127
94872841134535
101406313073751
114a2461082013
121a86774a041b
13a27cb7ca381
144c0ccc326b5
15268ac4da2bb
hex1476eca8c57

1406313073751 has 2 divisors, whose sum is σ = 1406313073752. Its totient is φ = 1406313073750.

The previous prime is 1406313073609. The next prime is 1406313073757. The reversal of 1406313073751 is 1573703136041.

It is a strong prime.

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

It is a cyclic number.

It is not a de Polignac number, because 1406313073751 - 214 = 1406313057367 is a prime.

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

It is a Sophie Germain prime.

It is a junction number, because it is equal to n+sod(n) for n = 1406313073699 and 1406313073708.

It is a congruent number.

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

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

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

Almost surely, 21406313073751 is an apocalyptic number.

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

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

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

The product of its (nonzero) digits is 158760, while the sum is 41.

The spelling of 1406313073751 in words is "one trillion, four hundred six billion, three hundred thirteen million, seventy-three thousand, seven hundred fifty-one".