Search a number
-
+
1269625397 is a prime number
BaseRepresentation
bin100101110101100…
…1111001000110101
310021111000122121212
41023223033020311
510100011003042
6325552251205
743314431525
oct11353171065
93244018555
101269625397
115a1741397
122b5240b05
13173061641
14c0895685
15766e0482
hex4bacf235

1269625397 has 2 divisors, whose sum is σ = 1269625398. Its totient is φ = 1269625396.

The previous prime is 1269625381. The next prime is 1269625463. The reversal of 1269625397 is 7935269621.

It is a happy number.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 1178823556 + 90801841 = 34334^2 + 9529^2 .

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

It is a cyclic number.

It is not a de Polignac number, because 1269625397 - 24 = 1269625381 is a prime.

It is a super-2 number, since 2×12696253972 = 3223897297414815218, which contains 22 as substring.

It is a congruent number.

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

It is a pernicious number, because its binary representation contains a prime number (17) of ones.

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

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

Almost surely, 21269625397 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The square root of 1269625397 is about 35631.8031679566. The cubic root of 1269625397 is about 1082.8256473942.

The spelling of 1269625397 in words is "one billion, two hundred sixty-nine million, six hundred twenty-five thousand, three hundred ninety-seven".