Search a number
-
+
537014520600079 is a prime number
BaseRepresentation
bin111101000011010010110111…
…1101111010101011000001111
32121102102002100021022021220211
41322012211233233111120033
51030341421214233200304
65142045022013223251
7221054006303025334
oct17206455757253017
92542362307267824
10537014520600079
11146122640a369a5
1250291018491b27
131a085337855ac2
1496878da31098b
154213ea7a91204
hex1e8696fbd560f

537014520600079 has 2 divisors, whose sum is σ = 537014520600080. Its totient is φ = 537014520600078.

The previous prime is 537014520600011. The next prime is 537014520600097. The reversal of 537014520600079 is 970006025410735.

Together with next prime (537014520600097) it forms an Ormiston pair, because they use the same digits, order apart.

It is a strong prime.

It is a cyclic number.

It is not a de Polignac number, because 537014520600079 - 27 = 537014520599951 is a prime.

It is a congruent number.

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

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

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

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

Almost surely, 2537014520600079 is an apocalyptic number.

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

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

537014520600079 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 49.

The spelling of 537014520600079 in words is "five hundred thirty-seven trillion, fourteen billion, five hundred twenty million, six hundred thousand, seventy-nine".