Search a number
-
+
2169361256537 is a prime number
BaseRepresentation
bin11111100100011000000…
…000011101000001011001
321200101111111221002210002
4133210120000131001121
5241020322440202122
64340331340302345
7312505536301256
oct37443000350131
97611444832702
102169361256537
117670259685a2
122b052a8419b5
13129754078c37
1476dd777642d
153b66b705992
hex1f91801d059

2169361256537 has 2 divisors, whose sum is σ = 2169361256538. Its totient is φ = 2169361256536.

The previous prime is 2169361256479. The next prime is 2169361256561. The reversal of 2169361256537 is 7356521639612.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2089921270336 + 79439986201 = 1445656^2 + 281851^2 .

It is a cyclic number.

It is not a de Polignac number, because 2169361256537 - 210 = 2169361255513 is a prime.

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

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

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

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

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

Almost surely, 22169361256537 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its digits is 12247200, while the sum is 56.

The spelling of 2169361256537 in words is "two trillion, one hundred sixty-nine billion, three hundred sixty-one million, two hundred fifty-six thousand, five hundred thirty-seven".