Search a number
-
+
7681310531501 is a prime number
BaseRepresentation
bin110111111000111000111…
…0010010001111110101101
31000012022210201221000010012
41233301301302101332231
52001322310444002001
624200424554423005
71421646015142325
oct157616162217655
930168721830105
107681310531501
1124a16975a8702
12a40833431a65
13439462a72369
141c7ac5318285
15d4c1db0b2bb
hex6fc71c91fad

7681310531501 has 2 divisors, whose sum is σ = 7681310531502. Its totient is φ = 7681310531500.

The previous prime is 7681310531471. The next prime is 7681310531527. The reversal of 7681310531501 is 1051350131867.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 5210723855401 + 2470586676100 = 2282701^2 + 1571810^2 .

It is a cyclic number.

It is not a de Polignac number, because 7681310531501 - 226 = 7681243422637 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 27681310531501 is an apocalyptic number.

It is an amenable number.

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

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

7681310531501 is an evil number, because the sum of its binary digits is even.

The product of its (nonzero) digits is 75600, while the sum is 41.

The spelling of 7681310531501 in words is "seven trillion, six hundred eighty-one billion, three hundred ten million, five hundred thirty-one thousand, five hundred one".