26107368354369 has 81 divisors (see below), whose sum is σ = 42286779957513. Its totient is φ = 15515987940864.

The previous prime is 26107368354359. The next prime is 26107368354409. The reversal of 26107368354369 is 96345386370162.

The square root of 26107368354369 is 5109537.

It is a perfect power (a square), and thus also a powerful number.

26107368354369 is a `hidden beast` number, since 2 + 6 + 1 + 0 + 7 + 3 + 6 + 83 + 543 + 6 + 9 = 666.

It can be written as a sum of positive squares in 4 ways, for example, as 2122449800769 + 23984918553600 = 1456863^2 + 4897440^2 .

It is a de Polignac number, because none of the positive numbers 2^k-26107368354369 is a prime.

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

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

It is a pernicious number, because its binary representation contains a prime number (23) of ones.

It is a polite number, since it can be written in 80 ways as a sum of consecutive naturals, for example, 4951138717 + ... + 4951143989.

It is a 1-persistent number, because it is pandigital, but 2⋅26107368354369 = 52214736708738 is not.

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

26107368354369 is the 5109537-th square number.

26107368354369 is the 2554769-th centered octagonal number.

It is an amenable number.

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

26107368354369 is an frugal number, since it uses more digits than its factorization.

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

The sum of its prime factors is 10624 (or 5312 counting only the distinct ones).

The product of its (nonzero) digits is 117573120, while the sum is 63.

The spelling of 26107368354369 in words is "twenty-six trillion, one hundred seven billion, three hundred sixty-eight million, three hundred fifty-four thousand, three hundred sixty-nine".