Base | Representation |
---|---|
bin | 100101001100000011111… |
… | …1001001100001110101010 |
3 | 200002121202101020200112112 |
4 | 1022120013321030032222 |
5 | 1132220110214440200 |
6 | 14512005451442322 |
7 | 1035160621023536 |
oct | 112300771141652 |
9 | 20077671220475 |
10 | 5111143515050 |
11 | 16a06952a3431 |
12 | 6a66a77563a2 |
13 | 2b0c954695a1 |
14 | 139548794bc6 |
15 | 8ce44de8535 |
hex | 4a607e4c3aa |
5111143515050 has 48 divisors (see below), whose sum is σ = 9684983996352. Its totient is φ = 2006448816000.
The previous prime is 5111143515043. The next prime is 5111143515053. The reversal of 5111143515050 is 505153411115.
It is a happy number.
It is a super-2 number, since 2×51111435150502 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5111143514998 and 5111143515016.
It is not an unprimeable number, because it can be changed into a prime (5111143515053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3451499 + ... + 4704798.
It is an arithmetic number, because the mean of its divisors is an integer number (201770499924).
Almost surely, 25111143515050 is an apocalyptic number.
5111143515050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5111143515050 is a deficient number, since it is larger than the sum of its proper divisors (4573840481302).
5111143515050 is a wasteful number, since it uses less digits than its factorization.
5111143515050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 8156543 (or 8156538 counting only the distinct ones).
The product of its (nonzero) digits is 7500, while the sum is 32.
Adding to 5111143515050 its reverse (505153411115), we get a palindrome (5616296926165).
The spelling of 5111143515050 in words is "five trillion, one hundred eleven billion, one hundred forty-three million, five hundred fifteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •