Base | Representation |
---|---|
bin | 101111000100101000… |
… | …101000010001100000 |
3 | 11211110110202012100200 |
4 | 233010220220101200 |
5 | 1312003132002222 |
6 | 35115221145200 |
7 | 3436342504125 |
oct | 570450502140 |
9 | 154413665320 |
10 | 50543625312 |
11 | 1a487616874 |
12 | 9966b5b200 |
13 | 49c658a7cb |
14 | 2636a0074c |
15 | 14ac478eac |
hex | bc4a28460 |
50543625312 has 72 divisors (see below), whose sum is σ = 144201873816. Its totient is φ = 16792966656.
The previous prime is 50543625311. The next prime is 50543625343. The reversal of 50543625312 is 21352634505.
50543625312 is a `hidden beast` number, since 5 + 0 + 543 + 62 + 53 + 1 + 2 = 666.
It is a tau number, because it is divible by the number of its divisors (72).
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50543625311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 197413 + ... + 374244.
It is an arithmetic number, because the mean of its divisors is an integer number (2002803803).
Almost surely, 250543625312 is an apocalyptic number.
It is an amenable number.
50543625312 is an abundant number, since it is smaller than the sum of its proper divisors (93658248504).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50543625312 is a wasteful number, since it uses less digits than its factorization.
50543625312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 571980 (or 571969 counting only the distinct ones).
The product of its (nonzero) digits is 108000, while the sum is 36.
The spelling of 50543625312 in words is "fifty billion, five hundred forty-three million, six hundred twenty-five thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •