Base | Representation |
---|---|
bin | 101111000111001010… |
… | …110100101101010000 |
3 | 11211120102202100102220 |
4 | 233013022310231100 |
5 | 1312100023043233 |
6 | 35123340341040 |
7 | 3440400061062 |
oct | 570712645520 |
9 | 154512670386 |
10 | 50586143568 |
11 | 1a4a9617424 |
12 | 9979244780 |
13 | 4a0232663c |
14 | 263c50b732 |
15 | 14b1076eb3 |
hex | bc72b4b50 |
50586143568 has 40 divisors (see below), whose sum is σ = 138367983168. Its totient is φ = 15870162432.
The previous prime is 50586143563. The next prime is 50586143617. The reversal of 50586143568 is 86534168505.
It is a happy number.
50586143568 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a Harshad number since it is a multiple of its sum of digits (51).
It is a self number, because there is not a number n which added to its sum of digits gives 50586143568.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50586143561) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 30995596 + ... + 30997227.
Almost surely, 250586143568 is an apocalyptic number.
It is an amenable number.
50586143568 is an abundant number, since it is smaller than the sum of its proper divisors (87781839600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50586143568 is a wasteful number, since it uses less digits than its factorization.
50586143568 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 61992851 (or 61992845 counting only the distinct ones).
The product of its (nonzero) digits is 3456000, while the sum is 51.
It can be divided in two parts, 50586143 and 568, that added together give a triangular number (50586711 = T10058).
The spelling of 50586143568 in words is "fifty billion, five hundred eighty-six million, one hundred forty-three thousand, five hundred sixty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •