10687491454352 has 10 divisors (see below), whose sum is σ = 20707014692838. Its totient is φ = 5343745727168.

The previous prime is 10687491454327. The next prime is 10687491454361. The reversal of 10687491454352 is 25345419478601.

It can be written as a sum of positive squares in only one way, i.e., 7421461783696 + 3266029670656 = 2724236^2 + 1807216^2 .

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

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

It is an unprimeable number.

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

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

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

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

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 29030400, while the sum is 59.

The spelling of 10687491454352 in words is "ten trillion, six hundred eighty-seven billion, four hundred ninety-one million, four hundred fifty-four thousand, three hundred fifty-two".