Base | Representation |
---|---|
bin | 101110101101010011… |
… | …001100011111100011 |
3 | 11210110012002012110222 |
4 | 232231103030133203 |
5 | 1310202421134111 |
6 | 35012314113255 |
7 | 3423550034666 |
oct | 565523143743 |
9 | 153405065428 |
10 | 50152130531 |
11 | 1a2a662aa68 |
12 | 9877a1b82b |
13 | 49634365a9 |
14 | 25daa116dd |
15 | 1487de57db |
hex | bad4cc7e3 |
50152130531 has 8 divisors (see below), whose sum is σ = 51429799344. Its totient is φ = 48879522720.
The previous prime is 50152130503. The next prime is 50152130569. The reversal of 50152130531 is 13503125105.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 50152130531 - 26 = 50152130467 is a prime.
It is a super-3 number, since 3×501521305313 (a number of 33 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 50152130531.
It is not an unprimeable number, because it can be changed into a prime (50152130731) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1245176 + ... + 1284821.
It is an arithmetic number, because the mean of its divisors is an integer number (6428724918).
Almost surely, 250152130531 is an apocalyptic number.
50152130531 is a deficient number, since it is larger than the sum of its proper divisors (1277668813).
50152130531 is a wasteful number, since it uses less digits than its factorization.
50152130531 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2530501.
The product of its (nonzero) digits is 2250, while the sum is 26.
Adding to 50152130531 its reverse (13503125105), we get a palindrome (63655255636).
The spelling of 50152130531 in words is "fifty billion, one hundred fifty-two million, one hundred thirty thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •