Base | Representation |
---|---|
bin | 100101000111010111011… |
… | …1011110111100100100010 |
3 | 200001122201201102110000010 |
4 | 1022032232323313210202 |
5 | 1132033433121010200 |
6 | 14503221202505350 |
7 | 1034353023011013 |
oct | 112165673674442 |
9 | 20048651373003 |
10 | 5101061110050 |
11 | 1697391015314 |
12 | 6a4753065256 |
13 | 2b0049689179 |
14 | 138c6d70100a |
15 | 8ca54bae150 |
hex | 4a3aeef7922 |
5101061110050 has 24 divisors (see below), whose sum is σ = 12650631553296. Its totient is φ = 1360282962640.
The previous prime is 5101061110039. The next prime is 5101061110091. The reversal of 5101061110050 is 500111601015.
It is a happy number.
It is a super-2 number, since 2×51010611100502 (a number of 26 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 5101061109999 and 5101061110026.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17003536884 + ... + 17003537183.
It is an arithmetic number, because the mean of its divisors is an integer number (527109648054).
Almost surely, 25101061110050 is an apocalyptic number.
5101061110050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
5101061110050 is an abundant number, since it is smaller than the sum of its proper divisors (7549570443246).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
5101061110050 is a wasteful number, since it uses less digits than its factorization.
5101061110050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34007074082 (or 34007074077 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 21.
Adding to 5101061110050 its reverse (500111601015), we get a palindrome (5601172711065).
The spelling of 5101061110050 in words is "five trillion, one hundred one billion, sixty-one million, one hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •