Base | Representation |
---|---|
bin | 110100001100110111… |
… | …111001100010111000 |
3 | 12100200021000012210212 |
4 | 310030313321202320 |
5 | 1404242420230224 |
6 | 41425501530252 |
7 | 4022661566660 |
oct | 641467714270 |
9 | 170607005725 |
10 | 56050555064 |
11 | 21853093689 |
12 | aa43273988 |
13 | 539345971a |
14 | 29da13d1a0 |
15 | 16d0b66d0e |
hex | d0cdf98b8 |
56050555064 has 32 divisors (see below), whose sum is σ = 120116304000. Its totient is φ = 24020072160.
The previous prime is 56050555061. The next prime is 56050555087. The reversal of 56050555064 is 46055505065.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56050555061) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1271879 + ... + 1315209.
It is an arithmetic number, because the mean of its divisors is an integer number (3753634500).
Almost surely, 256050555064 is an apocalyptic number.
It is an amenable number.
56050555064 is an abundant number, since it is smaller than the sum of its proper divisors (64065748936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56050555064 is a wasteful number, since it uses less digits than its factorization.
56050555064 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 66443 (or 66439 counting only the distinct ones).
The product of its (nonzero) digits is 450000, while the sum is 41.
The spelling of 56050555064 in words is "fifty-six billion, fifty million, five hundred fifty-five thousand, sixty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •