Base | Representation |
---|---|
bin | 101110100101101100… |
… | …100001001011010001 |
3 | 11210010022000111102122 |
4 | 232211230201023101 |
5 | 1304422241113441 |
6 | 34551515424025 |
7 | 3420440445236 |
oct | 564554411321 |
9 | 153108014378 |
10 | 50024551121 |
11 | 1a240611736 |
12 | 9841155015 |
13 | 4942b8780c |
14 | 25c7ac178d |
15 | 147bae434b |
hex | ba5b212d1 |
50024551121 has 4 divisors (see below), whose sum is σ = 50039847744. Its totient is φ = 50009254500.
The previous prime is 50024551103. The next prime is 50024551139. The reversal of 50024551121 is 12115542005.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is an interprime number because it is at equal distance from previous prime (50024551103) and next prime (50024551139).
It is a cyclic number.
It is not a de Polignac number, because 50024551121 - 214 = 50024534737 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (50024551321) 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 3 ways as a sum of consecutive naturals, for example, 7643405 + ... + 7649946.
It is an arithmetic number, because the mean of its divisors is an integer number (12509961936).
Almost surely, 250024551121 is an apocalyptic number.
It is an amenable number.
50024551121 is a deficient number, since it is larger than the sum of its proper divisors (15296623).
50024551121 is a wasteful number, since it uses less digits than its factorization.
50024551121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15296622.
The product of its (nonzero) digits is 2000, while the sum is 26.
The spelling of 50024551121 in words is "fifty billion, twenty-four million, five hundred fifty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •