Base | Representation |
---|---|
bin | 110100001011101001… |
… | …100010011010000111 |
3 | 12100121211100120111000 |
4 | 310023221202122013 |
5 | 1404222140404223 |
6 | 41423445344343 |
7 | 4022322152523 |
oct | 641351423207 |
9 | 170554316430 |
10 | 56030013063 |
11 | 21842533122 |
12 | aa384080b3 |
13 | 538c1166ab |
14 | 29d7512d83 |
15 | 16cde5a543 |
hex | d0ba62687 |
56030013063 has 8 divisors (see below), whose sum is σ = 83007426800. Its totient is φ = 37353342024.
The previous prime is 56030013043. The next prime is 56030013071. The reversal of 56030013063 is 36031003065.
56030013063 is a `hidden beast` number, since 56 + 0 + 300 + 1 + 306 + 3 = 666.
It is not a de Polignac number, because 56030013063 - 217 = 56029881991 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27), and also a Moran number because the ratio is a prime number: 2075185669 = 56030013063 / (5 + 6 + 0 + 3 + 0 + 0 + 1 + 3 + 0 + 6 + 3).
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56030013043) by changing a digit.
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 7 ways as a sum of consecutive naturals, for example, 1037592808 + ... + 1037592861.
It is an arithmetic number, because the mean of its divisors is an integer number (10375928350).
Almost surely, 256030013063 is an apocalyptic number.
56030013063 is a deficient number, since it is larger than the sum of its proper divisors (26977413737).
56030013063 is a wasteful number, since it uses less digits than its factorization.
56030013063 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2075185678 (or 2075185672 counting only the distinct ones).
The product of its (nonzero) digits is 4860, while the sum is 27.
The spelling of 56030013063 in words is "fifty-six billion, thirty million, thirteen thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •