Base | Representation |
---|---|
bin | 101110101100010011… |
… | …000000101111110000 |
3 | 11210102000102101110120 |
4 | 232230103000233300 |
5 | 1310134114231300 |
6 | 35010513330240 |
7 | 3423254030361 |
oct | 565423005760 |
9 | 153360371416 |
10 | 50135305200 |
11 | 1a298088932 |
12 | 9872266980 |
13 | 495cac5186 |
14 | 25d86b1b68 |
15 | 14866c03a0 |
hex | bac4c0bf0 |
50135305200 has 120 divisors (see below), whose sum is σ = 170047227888. Its totient is φ = 12582973440.
The previous prime is 50135305177. The next prime is 50135305201. The reversal of 50135305200 is 250353105.
It is a tau number, because it is divible by the number of its divisors (120).
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50135305201) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 1208407 + ... + 1249206.
Almost surely, 250135305200 is an apocalyptic number.
50135305200 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
50135305200 is an abundant number, since it is smaller than the sum of its proper divisors (119911922688).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50135305200 is a wasteful number, since it uses less digits than its factorization.
50135305200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2457651 (or 2457640 counting only the distinct ones).
The product of its (nonzero) digits is 2250, while the sum is 24.
Adding to 50135305200 its reverse (250353105), we get a palindrome (50385658305).
The spelling of 50135305200 in words is "fifty billion, one hundred thirty-five million, three hundred five thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.020 sec. • engine limits •