Base | Representation |
---|---|
bin | 10110111110011110100010… |
… | …10000101100001101000000 |
3 | 20121220011101211112101101110 |
4 | 23133033101100230031000 |
5 | 23110301113021210402 |
6 | 255242543410203320 |
7 | 13433216555305440 |
oct | 1337172120541500 |
9 | 217804354471343 |
10 | 50525211116352 |
11 | 1510a692538435 |
12 | 580015ab83540 |
13 | 2226678a5427b |
14 | c6960cc4c120 |
15 | 5c9423c6856c |
hex | 2df3d142c340 |
50525211116352 has 112 divisors (see below), whose sum is σ = 153546347110400. Its totient is φ = 14363232947712.
The previous prime is 50525211116333. The next prime is 50525211116371. The reversal of 50525211116352 is 25361111252505.
It is an interprime number because it is at equal distance from previous prime (50525211116333) and next prime (50525211116371).
It is a tau number, because it is divible by the number of its divisors (112).
It is a self number, because there is not a number n which added to its sum of digits gives 50525211116352.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 94187728 + ... + 94722639.
Almost surely, 250525211116352 is an apocalyptic number.
It is an amenable number.
50525211116352 is an abundant number, since it is smaller than the sum of its proper divisors (103021135994048).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50525211116352 is a wasteful number, since it uses less digits than its factorization.
50525211116352 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 188910588 (or 188910578 counting only the distinct ones).
The product of its (nonzero) digits is 90000, while the sum is 39.
Adding to 50525211116352 its reverse (25361111252505), we get a palindrome (75886322368857).
The spelling of 50525211116352 in words is "fifty trillion, five hundred twenty-five billion, two hundred eleven million, one hundred sixteen thousand, three hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •