Base | Representation |
---|---|
bin | 110100001011000101… |
… | …100001010000000011 |
3 | 12100121011120212121010 |
4 | 310023011201100003 |
5 | 1404212231234024 |
6 | 41422511132003 |
7 | 4022145666201 |
oct | 641305412003 |
9 | 170534525533 |
10 | 56020571139 |
11 | 21838174285 |
12 | aa35214003 |
13 | 538a18bb60 |
14 | 29d6176071 |
15 | 16cd1e2b29 |
hex | d0b161403 |
56020571139 has 32 divisors (see below), whose sum is σ = 81006831360. Its totient is φ = 34231992192.
The previous prime is 56020571137. The next prime is 56020571179. The reversal of 56020571139 is 93117502065.
It is not a de Polignac number, because 56020571139 - 21 = 56020571137 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a junction number, because it is equal to n+sod(n) for n = 56020571097 and 56020571106.
It is not an unprimeable number, because it can be changed into a prime (56020571137) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 3435684 + ... + 3451950.
It is an arithmetic number, because the mean of its divisors is an integer number (2531463480).
Almost surely, 256020571139 is an apocalyptic number.
56020571139 is a deficient number, since it is larger than the sum of its proper divisors (24986260221).
56020571139 is a wasteful number, since it uses less digits than its factorization.
56020571139 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16899.
The product of its (nonzero) digits is 56700, while the sum is 39.
The spelling of 56020571139 in words is "fifty-six billion, twenty million, five hundred seventy-one thousand, one hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •