Base | Representation |
---|---|
bin | 110100001100110110… |
… | …010100010011010011 |
3 | 12100200020020010221212 |
4 | 310030312110103103 |
5 | 1404242313442441 |
6 | 41425445010335 |
7 | 4022655221651 |
oct | 641466242323 |
9 | 170606203855 |
10 | 56050140371 |
11 | 21852930065 |
12 | aa430b39ab |
13 | 5393342a44 |
14 | 29da071dd1 |
15 | 16d0ad3eeb |
hex | d0cd944d3 |
56050140371 has 2 divisors, whose sum is σ = 56050140372. Its totient is φ = 56050140370.
The previous prime is 56050140347. The next prime is 56050140389. The reversal of 56050140371 is 17304105065.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 56050140371 - 222 = 56045946067 is a prime.
It is not a weakly prime, because it can be changed into another prime (56050142371) 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 as a sum of consecutive naturals, namely, 28025070185 + 28025070186.
It is an arithmetic number, because the mean of its divisors is an integer number (28025070186).
Almost surely, 256050140371 is an apocalyptic number.
56050140371 is a deficient number, since it is larger than the sum of its proper divisors (1).
56050140371 is an equidigital number, since it uses as much as digits as its factorization.
56050140371 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12600, while the sum is 32.
The spelling of 56050140371 in words is "fifty-six billion, fifty million, one hundred forty thousand, three hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •