Base | Representation |
---|---|
bin | 110100101000000001… |
… | …011001111110110010 |
3 | 12101212000001211202212 |
4 | 310220001121332302 |
5 | 1411211021011200 |
6 | 41543012212122 |
7 | 4040162230136 |
oct | 645001317662 |
9 | 171760054685 |
10 | 56506032050 |
11 | 21a67200246 |
12 | ab4b90a042 |
13 | 5436923330 |
14 | 2a408253c6 |
15 | 170ab38035 |
hex | d28059fb2 |
56506032050 has 48 divisors (see below), whose sum is σ = 113760734472. Its totient is φ = 20757811200.
The previous prime is 56506032019. The next prime is 56506032119. The reversal of 56506032050 is 5023060565.
It can be written as a sum of positive squares in 12 ways, for example, as 12823561 + 56493208489 = 3581^2 + 237683^2 .
It is a junction number, because it is equal to n+sod(n) for n = 56506031998 and 56506032016.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 92591 + ... + 348690.
Almost surely, 256506032050 is an apocalyptic number.
56506032050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56506032050 is an abundant number, since it is smaller than the sum of its proper divisors (57254702422).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56506032050 is a wasteful number, since it uses less digits than its factorization.
56506032050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 441503 (or 441498 counting only the distinct ones).
The product of its (nonzero) digits is 27000, while the sum is 32.
The spelling of 56506032050 in words is "fifty-six billion, five hundred six million, thirty-two thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •