Base | Representation |
---|---|
bin | 11010001011101010110010… |
… | …01101011100100101010010 |
3 | 21112212011111220120011100010 |
4 | 31011311121031130211102 |
5 | 30021304143011100200 |
6 | 322241500154535350 |
7 | 15061460250133533 |
oct | 1505653115344522 |
9 | 245764456504303 |
10 | 57575533300050 |
11 | 17388712614147 |
12 | 655a635737556 |
13 | 2618470ab674c |
14 | 10309564c068a |
15 | 69ca1224e150 |
hex | 345d5935c952 |
57575533300050 has 24 divisors (see below), whose sum is σ = 142787322584496. Its totient is φ = 15353475546640.
The previous prime is 57575533299997. The next prime is 57575533300063. The reversal of 57575533300050 is 5000333557575.
57575533300050 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 11 ways as a sum of consecutive naturals, for example, 191918444184 + ... + 191918444483.
It is an arithmetic number, because the mean of its divisors is an integer number (5949471774354).
Almost surely, 257575533300050 is an apocalyptic number.
57575533300050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
57575533300050 is an abundant number, since it is smaller than the sum of its proper divisors (85211789284446).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57575533300050 is a wasteful number, since it uses less digits than its factorization.
57575533300050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 383836888682 (or 383836888677 counting only the distinct ones).
The product of its (nonzero) digits is 4134375, while the sum is 48.
The spelling of 57575533300050 in words is "fifty-seven trillion, five hundred seventy-five billion, five hundred thirty-three million, three hundred thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •