60100511049989 has 8 divisors (see below), whose sum is σ = 60666976110840. Its totient is φ = 59534320248000.

The previous prime is 60100511049983. The next prime is 60100511049991. The reversal of 60100511049989 is 98994011500106.

60100511049989 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.

It can be written as a sum of positive squares in 4 ways, for example, as 1511559597025 + 58588951452964 = 1229455^2 + 7654342^2 .

It is a sphenic number, since it is the product of 3 distinct primes.

It is a cyclic number.

It is not a de Polignac number, because 60100511049989 - 2²⁴ = 60100494272773 is a prime.

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

It is a Duffinian number.

It is a Curzon number.

It is a self number, because there is not a number n which added to its sum of digits gives 60100511049989.

It is a congruent number.

It is not an unprimeable number, because it can be changed into a prime (60100511049983) 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 7 ways as a sum of consecutive naturals, for example, 68124362 + ... + 69000939.

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

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

It is an amenable number.

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

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

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

The sum of its prime factors is 137129431.

The product of its (nonzero) digits is 699840, while the sum is 53.

The spelling of 60100511049989 in words is "sixty trillion, one hundred billion, five hundred eleven million, forty-nine thousand, nine hundred eighty-nine".