Base | Representation |
---|---|
bin | 10110110000110010110011… |
… | …10011010111011010011100 |
3 | 20120020012211212210200221120 |
4 | 23120121121303113122130 |
5 | 23030100223202130202 |
6 | 254242550335530540 |
7 | 13354233636454503 |
oct | 1330313163273234 |
9 | 216205755720846 |
10 | 50055055505052 |
11 | 14a49258999994 |
12 | 5745008989a50 |
13 | 21c122c9865c0 |
14 | c5096b52783a |
15 | 5bc0a82720bc |
hex | 2d8659cd769c |
50055055505052 has 48 divisors (see below), whose sum is σ = 125779974997152. Its totient is φ = 15401481488640.
The previous prime is 50055055505003. The next prime is 50055055505069. The reversal of 50055055505052 is 25050555055005.
It is a super-2 number, since 2×500550555050522 (a number of 28 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 50055055504995 and 50055055505013.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 38006358 + ... + 39301314.
It is an arithmetic number, because the mean of its divisors is an integer number (2620416145774).
Almost surely, 250055055505052 is an apocalyptic number.
50055055505052 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
50055055505052 is an abundant number, since it is smaller than the sum of its proper divisors (75724919492100).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50055055505052 is a wasteful number, since it uses less digits than its factorization.
50055055505052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1542758 (or 1542756 counting only the distinct ones).
The product of its (nonzero) digits is 781250, while the sum is 42.
The spelling of 50055055505052 in words is "fifty trillion, fifty-five billion, fifty-five million, five hundred five thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •