Search a number
-
+
1425107177909 is a prime number
BaseRepresentation
bin10100101111001111000…
…000011101000110110101
312001020110011120120201222
4110233033000131012311
5141322104414143114
63010404000400125
7204650325100322
oct24571700350665
95036404516658
101425107177909
114aa4259386a8
121b0241616045
13a45053c806c
144cd92cd1b49
152710c45398e
hex14bcf01d1b5

1425107177909 has 2 divisors, whose sum is σ = 1425107177910. Its totient is φ = 1425107177908.

The previous prime is 1425107177887. The next prime is 1425107177947. The reversal of 1425107177909 is 9097717015241.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1164894965809 + 260212212100 = 1079303^2 + 510110^2 .

It is a cyclic number.

It is not a de Polignac number, because 1425107177909 - 28 = 1425107177653 is a prime.

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

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

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

Almost surely, 21425107177909 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1111320, while the sum is 53.

The spelling of 1425107177909 in words is "one trillion, four hundred twenty-five billion, one hundred seven million, one hundred seventy-seven thousand, nine hundred nine".