Base | Representation |
---|---|
bin | 110100001100110110… |
… | …010100010011011001 |
3 | 12100200020020010222002 |
4 | 310030312110103121 |
5 | 1404242313443002 |
6 | 41425445010345 |
7 | 4022655221660 |
oct | 641466242331 |
9 | 170606203862 |
10 | 56050140377 |
11 | 21852930070 |
12 | aa430b39b5 |
13 | 5393342a4a |
14 | 29da071dd7 |
15 | 16d0ad4002 |
hex | d0cd944d9 |
56050140377 has 32 divisors (see below), whose sum is σ = 74556370944. Its totient is φ = 40792377600.
The previous prime is 56050140371. The next prime is 56050140389. The reversal of 56050140377 is 77304105065.
It is a cyclic number.
It is not a de Polignac number, because 56050140377 - 220 = 56049091801 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 56050140377.
It is not an unprimeable number, because it can be changed into a prime (56050140371) 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 31 ways as a sum of consecutive naturals, for example, 8048 + ... + 334910.
It is an arithmetic number, because the mean of its divisors is an integer number (2329886592).
Almost surely, 256050140377 is an apocalyptic number.
It is an amenable number.
56050140377 is a deficient number, since it is larger than the sum of its proper divisors (18506230567).
56050140377 is a wasteful number, since it uses less digits than its factorization.
56050140377 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 327029.
The product of its (nonzero) digits is 88200, while the sum is 38.
The spelling of 56050140377 in words is "fifty-six billion, fifty million, one hundred forty thousand, three hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •