Search a number
-
+
507270905881 is a prime number
BaseRepresentation
bin1110110000110111011…
…00111100000000011001
31210111100120201000000221
413120123230330000121
531302342322442011
61025012000000041
751435434361565
oct7303354740031
91714316630027
10507270905881
11186150224723
1282390000021
1338ab2605c4c
141a7a2b3c6a5
15d2de110971
hex761bb3c019

507270905881 has 2 divisors, whose sum is σ = 507270905882. Its totient is φ = 507270905880.

The previous prime is 507270905849. The next prime is 507270905903. The reversal of 507270905881 is 188509072705.

It is a happy number.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 272336815881 + 234934090000 = 521859^2 + 484700^2 .

It is a cyclic number.

It is not a de Polignac number, because 507270905881 - 25 = 507270905849 is a prime.

It is a super-2 number, since 2×5072709058812 (a number of 24 digits) contains 22 as substring.

It is not a weakly prime, because it can be changed into another prime (507270906881) 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, 253635452940 + 253635452941.

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

Almost surely, 2507270905881 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1411200, while the sum is 52.

The spelling of 507270905881 in words is "five hundred seven billion, two hundred seventy million, nine hundred five thousand, eight hundred eighty-one".