Search a number
-
+
1351114726469 is a prime number
BaseRepresentation
bin10011101010010100101…
…101101001110001000101
311210011110111201121002112
4103222110231221301011
5134114040332221334
62512405445350405
7166420611453464
oct23522455516105
94704414647075
101351114726469
11481006048792
12199a31708405
139a542aa2b11
1449573d6c9db
152522b5ae4ce
hex13a94b69c45

1351114726469 has 2 divisors, whose sum is σ = 1351114726470. Its totient is φ = 1351114726468.

The previous prime is 1351114726439. The next prime is 1351114726477. The reversal of 1351114726469 is 9646274111531.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 935814390625 + 415300335844 = 967375^2 + 644438^2 .

It is a cyclic number.

It is a de Polignac number, because none of the positive numbers 2k-1351114726469 is a prime.

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

It is a Sophie Germain prime.

It is a Curzon number.

It is a congruent number.

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

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

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

Almost surely, 21351114726469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 1088640, while the sum is 50.

The spelling of 1351114726469 in words is "one trillion, three hundred fifty-one billion, one hundred fourteen million, seven hundred twenty-six thousand, four hundred sixty-nine".