Search a number
-
+
1160125469 is a prime number
BaseRepresentation
bin100010100100110…
…0001110000011101
32222211222110221222
41011021201300131
54333443003334
6311041303125
740514621666
oct10511416035
92884873858
101160125469
11545951488
12284634aa5
13156472a99
14b011036d
156bcb0d2e
hex45261c1d

1160125469 has 2 divisors, whose sum is σ = 1160125470. Its totient is φ = 1160125468.

The previous prime is 1160125433. The next prime is 1160125501. The reversal of 1160125469 is 9645210611.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 700237444 + 459888025 = 26462^2 + 21445^2 .

It is a cyclic number.

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

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

It is a congruent number.

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

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

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

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

Almost surely, 21160125469 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 12960, while the sum is 35.

The square root of 1160125469 is about 34060.6146303909. The cubic root of 1160125469 is about 1050.7554560303.

The spelling of 1160125469 in words is "one billion, one hundred sixty million, one hundred twenty-five thousand, four hundred sixty-nine".