Search a number
-
+
750513315061 is a prime number
BaseRepresentation
bin10101110101111100001…
…01000101110011110101
32122202012120012200020201
422322332011011303311
544244022402040221
61332440413000501
7105136263630436
oct12727605056365
92582176180221
10750513315061
1126a322222974
12101555483131
1355a08674493
1428479c9548d
15147c8a45891
hexaebe145cf5

750513315061 has 2 divisors, whose sum is σ = 750513315062. Its totient is φ = 750513315060.

The previous prime is 750513315043. The next prime is 750513315091. The reversal of 750513315061 is 160513315057.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 747135496900 + 3377818161 = 864370^2 + 58119^2 .

It is a cyclic number.

It is not a de Polignac number, because 750513315061 - 215 = 750513282293 is a prime.

It is a self number, because there is not a number n which added to its sum of digits gives 750513315061.

It is a congruent number.

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

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

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

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

Almost surely, 2750513315061 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 47250, while the sum is 37.

The spelling of 750513315061 in words is "seven hundred fifty billion, five hundred thirteen million, three hundred fifteen thousand, sixty-one".