Base | Representation |
---|---|
bin | 101110100100110101… |
… | …000001010001011001 |
3 | 11210002021122100111121 |
4 | 232210311001101121 |
5 | 1304410030040041 |
6 | 34550235525241 |
7 | 3420203002423 |
oct | 564465012131 |
9 | 153067570447 |
10 | 50010002521 |
11 | 1a2333850a6 |
12 | 98382b9821 |
13 | 493cb6278b |
14 | 25c5bb5813 |
15 | 147a6bd7d1 |
hex | ba4d41459 |
50010002521 has 4 divisors (see below), whose sum is σ = 50011151632. Its totient is φ = 50008853412.
The previous prime is 50010002513. The next prime is 50010002573. The reversal of 50010002521 is 12520001005.
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, and also an emirpimes, since its reverse is a distinct semiprime: 12520001005 = 5 ⋅2504000201.
It is a cyclic number.
It is not a de Polignac number, because 50010002521 - 23 = 50010002513 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 50010002495 and 50010002504.
It is not an unprimeable number, because it can be changed into a prime (50010002591) 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, 506595 + ... + 597208.
It is an arithmetic number, because the mean of its divisors is an integer number (12502787908).
Almost surely, 250010002521 is an apocalyptic number.
It is an amenable number.
50010002521 is a deficient number, since it is larger than the sum of its proper divisors (1149111).
50010002521 is a wasteful number, since it uses less digits than its factorization.
50010002521 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1149110.
The product of its (nonzero) digits is 100, while the sum is 16.
Adding to 50010002521 its reverse (12520001005), we get a palindrome (62530003526).
The spelling of 50010002521 in words is "fifty billion, ten million, two thousand, five hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •