Search a number
-
+
36713201463661 is a prime number
BaseRepresentation
bin10000101100011111101010…
…10101001111000101101101
311210222202012010121112202211
420112033311111033011231
514303002114033314121
6210025451212450421
710506304233333232
oct1026176525170555
9153882163545684
1036713201463661
1110774a8812a148
12414b320a79a11
131764069c88228
1490ccdd88d789
15439edbcb3ce1
hex2163f554f16d

36713201463661 has 2 divisors, whose sum is σ = 36713201463662. Its totient is φ = 36713201463660.

The previous prime is 36713201463611. The next prime is 36713201463707. The reversal of 36713201463661 is 16636410231763.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 31223575893636 + 5489625570025 = 5587806^2 + 2342995^2 .

It is a cyclic number.

It is not a de Polignac number, because 36713201463661 - 221 = 36713199366509 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 236713201463661 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The spelling of 36713201463661 in words is "thirty-six trillion, seven hundred thirteen billion, two hundred one million, four hundred sixty-three thousand, six hundred sixty-one".