Search a number
-
+
715132465709 is a prime number
BaseRepresentation
bin10100110100000010011…
…01110111001000101101
32112100212210220022012212
422122001031313020231
543204042402400314
61304305522340205
7102444435443234
oct12320115671055
92470783808185
10715132465709
112563166a7102
12b67204ba665
135258a585b6c
1426880d6bb1b
1513907835e3e
hexa68137722d

715132465709 has 2 divisors, whose sum is σ = 715132465710. Its totient is φ = 715132465708.

The previous prime is 715132465699. The next prime is 715132465721. The reversal of 715132465709 is 907564231517.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 362946002500 + 352186463209 = 602450^2 + 593453^2 .

It is a cyclic number.

It is not a de Polignac number, because 715132465709 - 224 = 715115688493 is a prime.

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

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

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

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

Almost surely, 2715132465709 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1587600, while the sum is 50.

The spelling of 715132465709 in words is "seven hundred fifteen billion, one hundred thirty-two million, four hundred sixty-five thousand, seven hundred nine".