Base | Representation |
---|---|
bin | 110100001011101010… |
… | …011111110110101111 |
3 | 12100121211211100201210 |
4 | 310023222133312233 |
5 | 1404222221433001 |
6 | 41423455005503 |
7 | 4022324251356 |
oct | 641352376657 |
9 | 170554740653 |
10 | 56030264751 |
11 | 2184269522a |
12 | aa38509893 |
13 | 538c1a4116 |
14 | 29d757a99d |
15 | 16cdea9dd6 |
hex | d0ba9fdaf |
56030264751 has 16 divisors (see below), whose sum is σ = 75015214560. Its totient is φ = 37199702400.
The previous prime is 56030264671. The next prime is 56030264767. The reversal of 56030264751 is 15746203065.
It is not a de Polignac number, because 56030264751 - 219 = 56029740463 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56030264651) by changing a digit.
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 15 ways as a sum of consecutive naturals, for example, 748705 + ... + 820133.
It is an arithmetic number, because the mean of its divisors is an integer number (4688450910).
Almost surely, 256030264751 is an apocalyptic number.
56030264751 is a deficient number, since it is larger than the sum of its proper divisors (18984949809).
56030264751 is a wasteful number, since it uses less digits than its factorization.
56030264751 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 72506.
The product of its (nonzero) digits is 151200, while the sum is 39.
The spelling of 56030264751 in words is "fifty-six billion, thirty million, two hundred sixty-four thousand, seven hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •