Base | Representation |
---|---|
bin | 110100111010010100… |
… | …100111011110011110 |
3 | 12102122101210101010111 |
4 | 310322110213132132 |
5 | 1412323120323300 |
6 | 42033301000234 |
7 | 4050611011315 |
oct | 647224473636 |
9 | 172571711114 |
10 | 56813057950 |
11 | 22104543360 |
12 | b0166b307a |
13 | 548541106c |
14 | 2a6d50727c |
15 | 1727a839ba |
hex | d3a52779e |
56813057950 has 48 divisors (see below), whose sum is σ = 115341439104. Its totient is φ = 20648079200.
The previous prime is 56813057947. The next prime is 56813057957. The reversal of 56813057950 is 5975031865.
It is a hoax number, since the sum of its digits (49) coincides with the sum of the digits of its distinct prime factors.
It is a junction number, because it is equal to n+sod(n) for n = 56813057894 and 56813057903.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (56813057957) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1021767 + ... + 1075933.
It is an arithmetic number, because the mean of its divisors is an integer number (2402946648).
Almost surely, 256813057950 is an apocalyptic number.
56813057950 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
56813057950 is an abundant number, since it is smaller than the sum of its proper divisors (58528381154).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
56813057950 is a wasteful number, since it uses less digits than its factorization.
56813057950 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56097 (or 56092 counting only the distinct ones).
The product of its (nonzero) digits is 1134000, while the sum is 49.
The spelling of 56813057950 in words is "fifty-six billion, eight hundred thirteen million, fifty-seven thousand, nine hundred fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.061 sec. • engine limits •