Search a number
-
+
1425718710469 is a prime number
BaseRepresentation
bin10100101111110011011…
…101010001000011000101
312001022000210021122201001
4110233303131101003011
5141324332442213334
63010544403533301
7205001432041144
oct24576335210305
95038023248631
101425718710469
114aa70a053109
121b039238a231
13a45a2000c51
144d0101db75b
1527145e9d714
hex14bf37510c5

1425718710469 has 2 divisors, whose sum is σ = 1425718710470. Its totient is φ = 1425718710468.

The previous prime is 1425718710343. The next prime is 1425718710487. The reversal of 1425718710469 is 9640178175241.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 1242567237025 + 183151473444 = 1114705^2 + 427962^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1425718710469 - 29 = 1425718709957 is a prime.

It is a super-2 number, since 2×14257187104692 (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 (1425718710499) by changing a digit.

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

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

Almost surely, 21425718710469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 3386880, while the sum is 55.

The spelling of 1425718710469 in words is "one trillion, four hundred twenty-five billion, seven hundred eighteen million, seven hundred ten thousand, four hundred sixty-nine".