Base | Representation |
---|---|
bin | 10110111110101000011001… |
… | …00000101001111011111101 |
3 | 20121220200001102201211110220 |
4 | 23133110030200221323331 |
5 | 23110342431012440123 |
6 | 255245220304051553 |
7 | 13433464620162141 |
oct | 1337241440517375 |
9 | 217820042654426 |
10 | 50530500124413 |
11 | 15111956aa1481 |
12 | 5801196303bb9 |
13 | 222700c73273a |
14 | c69991461221 |
15 | 5c963325bce3 |
hex | 2df50c829efd |
50530500124413 has 4 divisors (see below), whose sum is σ = 67374000165888. Its totient is φ = 33687000082940.
The previous prime is 50530500124411. The next prime is 50530500124501. The reversal of 50530500124413 is 31442100503505.
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 a cyclic number.
It is not a de Polignac number, because 50530500124413 - 21 = 50530500124411 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (50530500124411) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8421750020733 + ... + 8421750020738.
It is an arithmetic number, because the mean of its divisors is an integer number (16843500041472).
Almost surely, 250530500124413 is an apocalyptic number.
It is an amenable number.
50530500124413 is a deficient number, since it is larger than the sum of its proper divisors (16843500041475).
50530500124413 is a wasteful number, since it uses less digits than its factorization.
50530500124413 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 16843500041474.
The product of its (nonzero) digits is 36000, while the sum is 33.
Adding to 50530500124413 its reverse (31442100503505), we get a palindrome (81972600627918).
The spelling of 50530500124413 in words is "fifty trillion, five hundred thirty billion, five hundred million, one hundred twenty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •