Base | Representation |
---|---|
bin | 101110100110000101… |
… | …101100110110000001 |
3 | 11210010202102212211122 |
4 | 232212011230312001 |
5 | 1304430433340023 |
6 | 34552313122025 |
7 | 3420550531256 |
oct | 564605546601 |
9 | 153122385748 |
10 | 50031152513 |
11 | 1a244310431 |
12 | 98433b9315 |
13 | 4944359474 |
14 | 25c891d42d |
15 | 147c49a2c8 |
hex | ba616cd81 |
50031152513 has 4 divisors (see below), whose sum is σ = 50033938260. Its totient is φ = 50028366768.
The previous prime is 50031152461. The next prime is 50031152519. The reversal of 50031152513 is 31525113005.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 28314119824 + 21717032689 = 168268^2 + 147367^2 .
It is a cyclic number.
It is not a de Polignac number, because 50031152513 - 216 = 50031086977 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (50031152519) 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, 1365758 + ... + 1401911.
It is an arithmetic number, because the mean of its divisors is an integer number (12508484565).
Almost surely, 250031152513 is an apocalyptic number.
It is an amenable number.
50031152513 is a deficient number, since it is larger than the sum of its proper divisors (2785747).
50031152513 is a wasteful number, since it uses less digits than its factorization.
50031152513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2785746.
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 50031152513 its reverse (31525113005), we get a palindrome (81556265518).
The spelling of 50031152513 in words is "fifty billion, thirty-one million, one hundred fifty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •