Base | Representation |
---|---|
bin | 110100101000010001… |
… | …001011010000100010 |
3 | 12101212021211212112222 |
4 | 310220101023100202 |
5 | 1411213100303200 |
6 | 41543240551042 |
7 | 4040242325462 |
oct | 645021132042 |
9 | 171767755488 |
10 | 56510166050 |
11 | 21a69574178 |
12 | ab51182482 |
13 | 543773cba0 |
14 | 2a411bdba2 |
15 | 170b1a2d85 |
hex | d2844b422 |
56510166050 has 24 divisors (see below), whose sum is σ = 113194210836. Its totient is φ = 20865291840.
The previous prime is 56510166047. The next prime is 56510166061. The reversal of 56510166050 is 5066101565.
It can be written as a sum of positive squares in 6 ways, for example, as 16662420889 + 39847745161 = 129083^2 + 199619^2 .
It is a self number, because there is not a number n which added to its sum of digits gives 56510166050.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 43468709 + ... + 43470008.
Almost surely, 256510166050 is an apocalyptic number.
56510166050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56510166050 is an abundant number, since it is smaller than the sum of its proper divisors (56684044786).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56510166050 is a wasteful number, since it uses less digits than its factorization.
56510166050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86938742 (or 86938737 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 35.
The spelling of 56510166050 in words is "fifty-six billion, five hundred ten million, one hundred sixty-six thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •