Base | Representation |
---|---|
bin | 10110110000111110000010… |
… | …01101111110111010101110 |
3 | 20120020210102010022100021110 |
4 | 23120133001031332322232 |
5 | 23030200100342100100 |
6 | 254245424543412450 |
7 | 13354536236553051 |
oct | 1330370115767256 |
9 | 216223363270243 |
10 | 50061085503150 |
11 | 14a50872749797 |
12 | 57462102b4126 |
13 | 21c1981026507 |
14 | c50d80304a98 |
15 | 5bc30c833250 |
hex | 2d87c137eeae |
50061085503150 has 48 divisors (see below), whose sum is σ = 130685781110400. Its totient is φ = 12647011073760.
The previous prime is 50061085503103. The next prime is 50061085503173. The reversal of 50061085503150 is 5130558016005.
It is a super-2 number, since 2×500610855031502 (a number of 28 digits) contains 22 as substring.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 50061085503099 and 50061085503108.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 8782643730 + ... + 8782649429.
It is an arithmetic number, because the mean of its divisors is an integer number (2722620439800).
Almost surely, 250061085503150 is an apocalyptic number.
50061085503150 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50061085503150 is an abundant number, since it is smaller than the sum of its proper divisors (80624695607250).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50061085503150 is a wasteful number, since it uses less digits than its factorization.
50061085503150 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17565293193 (or 17565293188 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 39.
The spelling of 50061085503150 in words is "fifty trillion, sixty-one billion, eighty-five million, five hundred three thousand, one hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •