103714352067657 has 64 divisors (see below), whose sum is σ = 144801710899200. Its totient is φ = 65953997007360.

The previous prime is 103714352067629. The next prime is 103714352067659. The reversal of 103714352067657 is 756760253417301.

It is not a de Polignac number, because 103714352067657 - 2¹⁵ = 103714352034889 is a prime.

It is a super-2 number, since 2×103714352067657² (a number of 29 digits) contains 22 as substring.

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

It is not an unprimeable number, because it can be changed into a prime (103714352067659) by changing a digit.

It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 16559848708 + ... + 16559854970.

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

Almost surely, 2^{103714352067657} is an apocalyptic number.

It is an amenable number.

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

103714352067657 is a wasteful number, since it uses less digits than its factorization.

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

The sum of its prime factors is 12318.

The product of its (nonzero) digits is 22226400, while the sum is 57.

The spelling of 103714352067657 in words is "one hundred three trillion, seven hundred fourteen billion, three hundred fifty-two million, sixty-seven thousand, six hundred fifty-seven".