Base | Representation |
---|---|
bin | 10111000000111100101010… |
… | …10111000101100100000010 |
3 | 20122012021112021022012211221 |
4 | 23200132111113011210002 |
5 | 23113143444002143200 |
6 | 255345543403425254 |
7 | 13442313410564656 |
oct | 1340362527054402 |
9 | 218167467265757 |
10 | 50610105506050 |
11 | 15142697178982 |
12 | 58146b1b2522a |
13 | 2231687b8b65c |
14 | c6d783a36a66 |
15 | 5cb741c7b91a |
hex | 2e07955c5902 |
50610105506050 has 12 divisors (see below), whose sum is σ = 94134796241346. Its totient is φ = 20244042202400.
The previous prime is 50610105506047. The next prime is 50610105506069. The reversal of 50610105506050 is 5060550101605.
It can be written as a sum of positive squares in 3 ways, for example, as 36320715128889 + 14289390377161 = 6026667^2 + 3780131^2 .
It is a super-2 number, since 2×506101055060502 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50610105505997 and 50610105506015.
It is an unprimeable number.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 506101055011 + ... + 506101055110.
Almost surely, 250610105506050 is an apocalyptic number.
50610105506050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50610105506050 is a deficient number, since it is larger than the sum of its proper divisors (43524690735296).
50610105506050 is a wasteful number, since it uses less digits than its factorization.
50610105506050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1012202110133 (or 1012202110128 counting only the distinct ones).
The product of its (nonzero) digits is 22500, while the sum is 34.
Adding to 50610105506050 its reverse (5060550101605), we get a palindrome (55670655607655).
The spelling of 50610105506050 in words is "fifty trillion, six hundred ten billion, one hundred five million, five hundred six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •