Base | Representation |
---|---|
bin | 101110101010110100… |
… | …011100101101010010 |
3 | 11210100021202222010220 |
4 | 232222310130231102 |
5 | 1310111243003200 |
6 | 35004230133510 |
7 | 3422533233660 |
oct | 565264345522 |
9 | 153307688126 |
10 | 50110516050 |
11 | 1a285097431 |
12 | 9865ab1296 |
13 | 4957925c3a |
14 | 25d529bc30 |
15 | 14844254a0 |
hex | baad1cb52 |
50110516050 has 96 divisors (see below), whose sum is σ = 144147535872. Its totient is φ = 11282863680.
The previous prime is 50110516033. The next prime is 50110516051. The reversal of 50110516050 is 5061501105.
It is a super-2 number, since 2×501105160502 (a number of 22 digits) contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 50110516050.
It is not an unprimeable number, because it can be changed into a prime (50110516051) 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 47 ways as a sum of consecutive naturals, for example, 285802 + ... + 426501.
It is an arithmetic number, because the mean of its divisors is an integer number (1501536832).
Almost surely, 250110516050 is an apocalyptic number.
50110516050 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
50110516050 is an abundant number, since it is smaller than the sum of its proper divisors (94037019822).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
50110516050 is a wasteful number, since it uses less digits than its factorization.
50110516050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 712392 (or 712387 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 24.
The spelling of 50110516050 in words is "fifty billion, one hundred ten million, five hundred sixteen thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •