5105011112 has 32 divisors (see below), whose sum is σ = 9626337000. Its totient is φ = 2538031104.

The previous prime is 5105011099. The next prime is 5105011117. The reversal of 5105011112 is 2111105015.

It can be written as a sum of positive squares in 4 ways, for example, as 3624762436 + 1480248676 = 60206^2 + 38474^2 .

It is a super-3 number, since 3×5105011112³ (a number of 30 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.

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

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

It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1095764 + ... + 1100412.

Almost surely, 2^5105011112 is an apocalyptic number.

It is an amenable number.

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

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

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

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

The product of its (nonzero) digits is 50, while the sum is 17.

The square root of 5105011112 is about 71449.3604729951. The cubic root of 5105011112 is about 1721.8642028596.

Adding to 5105011112 its reverse (2111105015), we get a palindrome (7216116127).

The spelling of 5105011112 in words is "five billion, one hundred five million, eleven thousand, one hundred twelve".