Base | Representation |
---|---|
bin | 10110101111011111001010… |
… | …10011001000001101001110 |
3 | 20120001220221102110212210101 |
4 | 23113233211103020031032 |
5 | 23023331242203133032 |
6 | 254210202445201314 |
7 | 13351054111411564 |
oct | 1327574523101516 |
9 | 216056842425711 |
10 | 50010151224142 |
11 | 14a3120567102a |
12 | 573837656023a |
13 | 21b9c2484a595 |
14 | c4c70b893a34 |
15 | 5bad2ae3ede7 |
hex | 2d7be54c834e |
50010151224142 has 16 divisors (see below), whose sum is σ = 75034084591872. Its totient is φ = 24998790068280.
The previous prime is 50010151224139. The next prime is 50010151224197. The reversal of 50010151224142 is 24142215101005.
It is a super-2 number, since 2×500101512241422 (a number of 28 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 50010151224142.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 344096253 + ... + 344241559.
It is an arithmetic number, because the mean of its divisors is an integer number (4689630286992).
Almost surely, 250010151224142 is an apocalyptic number.
50010151224142 is a deficient number, since it is larger than the sum of its proper divisors (25023933367730).
50010151224142 is a wasteful number, since it uses less digits than its factorization.
50010151224142 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 187383.
The product of its (nonzero) digits is 3200, while the sum is 28.
Adding to 50010151224142 its reverse (24142215101005), we get a palindrome (74152366325147).
The spelling of 50010151224142 in words is "fifty trillion, ten billion, one hundred fifty-one million, two hundred twenty-four thousand, one hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •