Base | Representation |
---|---|
bin | 101110111001001111… |
… | …010110101010110001 |
3 | 11210222011000111102220 |
4 | 232321033112222301 |
5 | 1311110211401400 |
6 | 35044231431253 |
7 | 3431531523300 |
oct | 567117265261 |
9 | 153864014386 |
10 | 50352450225 |
11 | 1a399711130 |
12 | 9912b25529 |
13 | 4995aa325c |
14 | 2619478437 |
15 | 149a7b47a0 |
hex | bb93d6ab1 |
50352450225 has 144 divisors (see below), whose sum is σ = 106742293056. Its totient is φ = 20708352000.
The previous prime is 50352450209. The next prime is 50352450227. The reversal of 50352450225 is 52205425305.
It is not a de Polignac number, because 50352450225 - 24 = 50352450209 is a prime.
It is a super-2 number, since 2×503524502252 (a number of 22 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (33).
It is not an unprimeable number, because it can be changed into a prime (50352450227) by changing a digit.
It is a polite number, since it can be written in 143 ways as a sum of consecutive naturals, for example, 3914805 + ... + 3927645.
It is an arithmetic number, because the mean of its divisors is an integer number (741265924).
Almost surely, 250352450225 is an apocalyptic number.
50352450225 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
50352450225 is an abundant number, since it is smaller than the sum of its proper divisors (56389842831).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50352450225 is a wasteful number, since it uses less digits than its factorization.
50352450225 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12976 (or 12964 counting only the distinct ones).
The product of its (nonzero) digits is 60000, while the sum is 33.
The spelling of 50352450225 in words is "fifty billion, three hundred fifty-two million, four hundred fifty thousand, two hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •