Base | Representation |
---|---|
bin | 10110110000101001111100… |
… | …10111100001001001101100 |
3 | 20120012202120110221212011001 |
4 | 23120110332113201021230 |
5 | 23030011003331042110 |
6 | 254240442430210044 |
7 | 13354005045465322 |
oct | 1330247627411154 |
9 | 216182513855131 |
10 | 50050300252780 |
11 | 14a47238758533 |
12 | 5744100353924 |
13 | 21c095274b869 |
14 | c50639b75d12 |
15 | 5bbdcaa6363a |
hex | 2d853e5e126c |
50050300252780 has 12 divisors (see below), whose sum is σ = 105105630530880. Its totient is φ = 20020120101104.
The previous prime is 50050300252763. The next prime is 50050300252859. The reversal of 50050300252780 is 8725200305005.
50050300252780 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1251257506300 + ... + 1251257506339.
It is an arithmetic number, because the mean of its divisors is an integer number (8758802544240).
Almost surely, 250050300252780 is an apocalyptic number.
It is an amenable number.
50050300252780 is an abundant number, since it is smaller than the sum of its proper divisors (55055330278100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50050300252780 is a wasteful number, since it uses less digits than its factorization.
50050300252780 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2502515012648 (or 2502515012646 counting only the distinct ones).
The product of its (nonzero) digits is 84000, while the sum is 37.
Adding to 50050300252780 its reverse (8725200305005), we get a palindrome (58775500557785).
The spelling of 50050300252780 in words is "fifty trillion, fifty billion, three hundred million, two hundred fifty-two thousand, seven hundred eighty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •