Base | Representation |
---|---|
bin | 101110101010111010… |
… | …001010101001001101 |
3 | 11210100101121010012210 |
4 | 232222322022221031 |
5 | 1310112133434200 |
6 | 35004322221033 |
7 | 3422552045610 |
oct | 565272125115 |
9 | 153311533183 |
10 | 50112014925 |
11 | 1a285a20575 |
12 | 98664b4779 |
13 | 495802c24b |
14 | 25d556c177 |
15 | 148461e650 |
hex | baae8aa4d |
50112014925 has 96 divisors (see below), whose sum is σ = 95401036800. Its totient is φ = 22736540160.
The previous prime is 50112014921. The next prime is 50112014959. The reversal of 50112014925 is 52941021105.
It is not a de Polignac number, because 50112014925 - 22 = 50112014921 is a prime.
It is a super-3 number, since 3×501120149253 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a junction number, because it is equal to n+sod(n) for n = 50112014892 and 50112014901.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50112014921) 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 95 ways as a sum of consecutive naturals, for example, 67810206 + ... + 67810944.
It is an arithmetic number, because the mean of its divisors is an integer number (993760800).
Almost surely, 250112014925 is an apocalyptic number.
It is an amenable number.
50112014925 is a deficient number, since it is larger than the sum of its proper divisors (45289021875).
50112014925 is a wasteful number, since it uses less digits than its factorization.
50112014925 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1555 (or 1550 counting only the distinct ones).
The product of its (nonzero) digits is 3600, while the sum is 30.
The spelling of 50112014925 in words is "fifty billion, one hundred twelve million, fourteen thousand, nine hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •