Search a number
-
+
36703671630313 is a prime number
BaseRepresentation
bin10000101100001101111010…
…10011110011100111101001
311210221211120222112212001011
420112012331103303213221
514302323104414132223
6210021233423223521
710505516125152442
oct1026067523634751
9153854528485034
1036703671630313
1110770a37855316
124149501447ba1
1317631ab80899c
1490c677d582c9
15439b3032980d
hex2161bd4f39e9

36703671630313 has 2 divisors, whose sum is σ = 36703671630314. Its totient is φ = 36703671630312.

The previous prime is 36703671630259. The next prime is 36703671630319. The reversal of 36703671630313 is 31303617630763.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 35848096579584 + 855575050729 = 5987328^2 + 924973^2 .

It is a cyclic number.

It is not a de Polignac number, because 36703671630313 - 217 = 36703671499241 is a prime.

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

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

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

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

Almost surely, 236703671630313 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 2571912, while the sum is 49.

The spelling of 36703671630313 in words is "thirty-six trillion, seven hundred three billion, six hundred seventy-one million, six hundred thirty thousand, three hundred thirteen".