Search a number
-
+
36970914661 is a prime number
BaseRepresentation
bin100010011011101000…
…110110001101100101
310112102120022001120121
4202123220312031211
51101204023232121
624552331001541
72446113406132
oct423350661545
9115376261517
1036970914661
111475213242a
1271b95992b1
133642656485
141b0a193589
15e65aea141
hex89ba36365

36970914661 has 2 divisors, whose sum is σ = 36970914662. Its totient is φ = 36970914660.

The previous prime is 36970914653. The next prime is 36970914677. The reversal of 36970914661 is 16641907963.

36970914661 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It is a weak prime.

It can be written as a sum of positive squares in only one way, i.e., 34408024036 + 2562890625 = 185494^2 + 50625^2 .

It is an emirp because it is prime and its reverse (16641907963) is a distict prime.

It is a cyclic number.

It is not a de Polignac number, because 36970914661 - 23 = 36970914653 is a prime.

It is a junction number, because it is equal to n+sod(n) for n = 36970914599 and 36970914608.

It is a congruent number.

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

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

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

Almost surely, 236970914661 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1469664, while the sum is 52.

The spelling of 36970914661 in words is "thirty-six billion, nine hundred seventy million, nine hundred fourteen thousand, six hundred sixty-one".