Base | Representation |
---|---|
bin | 110100001100110101… |
… | …110100101110101010 |
3 | 12100200012222120120012 |
4 | 310030311310232222 |
5 | 1404242300323200 |
6 | 41425442131522 |
7 | 4022654142635 |
oct | 641465645652 |
9 | 170605876505 |
10 | 56050011050 |
11 | 21852851990 |
12 | aa43050ba2 |
13 | 53932c8c17 |
14 | 29da03ac1c |
15 | 16d0aaaa35 |
hex | d0cd74baa |
56050011050 has 24 divisors (see below), whose sum is σ = 113730568992. Its totient is φ = 20381822000.
The previous prime is 56050011037. The next prime is 56050011071. The reversal of 56050011050 is 5011005065.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 50954006 + ... + 50955105.
It is an arithmetic number, because the mean of its divisors is an integer number (4738773708).
Almost surely, 256050011050 is an apocalyptic number.
56050011050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56050011050 is an abundant number, since it is smaller than the sum of its proper divisors (57680557942).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56050011050 is a wasteful number, since it uses less digits than its factorization.
56050011050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101909134 (or 101909129 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 23.
The spelling of 56050011050 in words is "fifty-six billion, fifty million, eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •