Base | Representation |
---|---|
bin | 101110110000001011… |
… | …010101000010000000 |
3 | 11210120112220112202002 |
4 | 232300023111002000 |
5 | 1310302300300000 |
6 | 35021200443132 |
7 | 3425004234212 |
oct | 566013250200 |
9 | 153515815662 |
10 | 50200400000 |
11 | 1a3208a9593 |
12 | 98900194a8 |
13 | 49704370ca |
14 | 26031b85b2 |
15 | 148c27c8d5 |
hex | bb02d5080 |
50200400000 has 192 divisors, whose sum is σ = 128093442120. Its totient is φ = 19584000000.
The previous prime is 50200399987. The next prime is 50200400017. The reversal of 50200400000 is 400205.
It can be written as a sum of positive squares in 12 ways, for example, as 23096704576 + 27103695424 = 151976^2 + 164632^2 .
It is an unprimeable number.
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 23 ways as a sum of consecutive naturals, for example, 16398470 + ... + 16401530.
Almost surely, 250200400000 is an apocalyptic number.
50200400000 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 50200400000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (64046721060).
50200400000 is an abundant number, since it is smaller than the sum of its proper divisors (77893042120).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50200400000 is an frugal number, since it uses more digits than its factorization.
50200400000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3141 (or 3109 counting only the distinct ones).
The product of its (nonzero) digits is 40, while the sum is 11.
Adding to 50200400000 its reverse (400205), we get a palindrome (50200800205).
The spelling of 50200400000 in words is "fifty billion, two hundred million, four hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •