Base | Representation |
---|---|
bin | 101110101100110001… |
… | …011100101101101000 |
3 | 11210102120102202102100 |
4 | 232230301130231220 |
5 | 1310143140042242 |
6 | 35011400333400 |
7 | 3423411611400 |
oct | 565461345550 |
9 | 153376382370 |
10 | 50143284072 |
11 | 1a2a1638542 |
12 | 9874a74260 |
13 | 4961659abb |
14 | 25d978b800 |
15 | 148724954c |
hex | bacc5cb68 |
50143284072 has 72 divisors (see below), whose sum is σ = 157976939250. Its totient is φ = 14326651584.
The previous prime is 50143284043. The next prime is 50143284073. The reversal of 50143284072 is 27048234105.
It is a happy number.
50143284072 is a `hidden beast` number, since 501 + 4 + 3 + 2 + 84 + 0 + 72 = 666.
It can be written as a sum of positive squares in only one way, i.e., 25164745956 + 24978538116 = 158634^2 + 158046^2 .
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 not an unprimeable number, because it can be changed into a prime (50143284073) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 17 ways as a sum of consecutive naturals, for example, 7102947 + ... + 7110002.
Almost surely, 250143284072 is an apocalyptic number.
It is an amenable number.
50143284072 is an abundant number, since it is smaller than the sum of its proper divisors (107833655178).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50143284072 is a wasteful number, since it uses less digits than its factorization.
50143284072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14212975 (or 14212961 counting only the distinct ones).
The product of its (nonzero) digits is 53760, while the sum is 36.
The spelling of 50143284072 in words is "fifty billion, one hundred forty-three million, two hundred eighty-four thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •