Base | Representation |
---|---|
bin | 110100010001011110… |
… | …101111001011000010 |
3 | 12100212122102221202020 |
4 | 310101132233023002 |
5 | 1404422212020213 |
6 | 41441302302310 |
7 | 4024620545145 |
oct | 642136571302 |
9 | 170778387666 |
10 | 56127845058 |
11 | 2189278380a |
12 | aa65127996 |
13 | 53a647b44c |
14 | 2a064dc05c |
15 | 16d7832923 |
hex | d117af2c2 |
56127845058 has 8 divisors (see below), whose sum is σ = 112255690128. Its totient is φ = 18709281684.
The previous prime is 56127845041. The next prime is 56127845063. The reversal of 56127845058 is 85054872165.
56127845058 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
56127845058 is an admirable number.
It is a Smith number, since the sum of its digits (51) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a self number, because there is not a number n which added to its sum of digits gives 56127845058.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 4677320416 + ... + 4677320427.
It is an arithmetic number, because the mean of its divisors is an integer number (14031961266).
Almost surely, 256127845058 is an apocalyptic number.
56127845058 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56127845058 is a wasteful number, since it uses less digits than its factorization.
56127845058 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9354640848.
The product of its (nonzero) digits is 2688000, while the sum is 51.
The spelling of 56127845058 in words is "fifty-six billion, one hundred twenty-seven million, eight hundred forty-five thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •