Base | Representation |
---|---|
bin | 100100110100010011000… |
… | …0110000101101100110110 |
3 | 122220202000210211020211222 |
4 | 1021220212012011230312 |
5 | 1130401101303330420 |
6 | 14432325511230342 |
7 | 1031403154321541 |
oct | 111504606055466 |
9 | 18822023736758 |
10 | 5060110605110 |
11 | 1680a87579900 |
12 | 6988249783b2 |
13 | 2a9221709062 |
14 | 136ca6bcb858 |
15 | 8b959a21225 |
hex | 49a26185b36 |
5060110605110 has 48 divisors (see below), whose sum is σ = 10356715479600. Its totient is φ = 1776590544960.
The previous prime is 5060110605097. The next prime is 5060110605157. The reversal of 5060110605110 is 115060110605.
It is a super-2 number, since 2×50601106051102 (a number of 26 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 5060110605110.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 72066800 + ... + 72136979.
It is an arithmetic number, because the mean of its divisors is an integer number (215764905825).
Almost surely, 25060110605110 is an apocalyptic number.
5060110605110 is an abundant number, since it is smaller than the sum of its proper divisors (5296604874490).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5060110605110 is a wasteful number, since it uses less digits than its factorization.
5060110605110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 144203837 (or 144203826 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 5060110605110 its reverse (115060110605), we get a palindrome (5175170715715).
The spelling of 5060110605110 in words is "five trillion, sixty billion, one hundred ten million, six hundred five thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •