491132769148560 has 960 divisors, whose sum is σ = 1939454975937024. Its totient is φ = 100620335185920.

The previous prime is 491132769148523. The next prime is 491132769148561. The reversal of 491132769148560 is 65841967231194.

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

It is a Harshad number since it is a multiple of its sum of digits (66).

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

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

It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 75874053484 + ... + 75874059956.

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

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

491132769148560 is a gapful number since it is divisible by the number (40) formed by its first and last digit.

It is an amenable number.

It is a practical number, because each smaller number is the sum of distinct divisors of 491132769148560, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (969727487968512).

491132769148560 is an abundant number, since it is smaller than the sum of its proper divisors (1448322206788464).

It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.

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

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

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

The product of its (nonzero) digits is 78382080, while the sum is 66.

The spelling of 491132769148560 in words is "four hundred ninety-one trillion, one hundred thirty-two billion, seven hundred sixty-nine million, one hundred forty-eight thousand, five hundred sixty".