Search a number
-
+
3697812040613 is a prime number
BaseRepresentation
bin110101110011110110110…
…001011110101110100101
3111002111200212201211011012
4311303312301132232211
5441041104340244423
611510430145152005
7531105141510215
oct65636661365645
914074625654135
103697812040613
1111a626254a079
124b87b192b605
1320a9188c2b02
14cad917b6245
15662c66ac078
hex35cf6c5eba5

3697812040613 has 2 divisors, whose sum is σ = 3697812040614. Its totient is φ = 3697812040612.

The previous prime is 3697812040543. The next prime is 3697812040639. The reversal of 3697812040613 is 3160402187963.

It is a strong prime.

It can be written as a sum of positive squares in only one way, i.e., 2930266087204 + 767545953409 = 1711802^2 + 876097^2 .

It is a cyclic number.

It is not a de Polignac number, because 3697812040613 - 28 = 3697812040357 is a prime.

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

It is a congruent number.

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

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

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

Almost surely, 23697812040613 is an apocalyptic number.

It is an amenable number.

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

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

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

The product of its (nonzero) digits is 1306368, while the sum is 50.

The spelling of 3697812040613 in words is "three trillion, six hundred ninety-seven billion, eight hundred twelve million, forty thousand, six hundred thirteen".