Base | Representation |
---|---|
bin | 100101010010000111000… |
… | …0001000001000001101101 |
3 | 200010212021111201221222001 |
4 | 1022210032001001001231 |
5 | 1132423210032202001 |
6 | 14521554321252301 |
7 | 1036130513653534 |
oct | 112441601010155 |
9 | 20125244657861 |
10 | 5124131131501 |
11 | 16a614a48a948 |
12 | 6a9111194091 |
13 | 2b22850c3835 |
14 | 13a01b61931b |
15 | 8d455201001 |
hex | 4a90e04106d |
5124131131501 has 2 divisors, whose sum is σ = 5124131131502. Its totient is φ = 5124131131500.
The previous prime is 5124131131459. The next prime is 5124131131513. The reversal of 5124131131501 is 1051311314215.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5118336115876 + 5795015625 = 2262374^2 + 76125^2 .
It is a cyclic number.
It is not a de Polignac number, because 5124131131501 - 215 = 5124131098733 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5124131131501.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5124131131601) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2562065565750 + 2562065565751.
It is an arithmetic number, because the mean of its divisors is an integer number (2562065565751).
Almost surely, 25124131131501 is an apocalyptic number.
It is an amenable number.
5124131131501 is a deficient number, since it is larger than the sum of its proper divisors (1).
5124131131501 is an equidigital number, since it uses as much as digits as its factorization.
5124131131501 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1800, while the sum is 28.
Adding to 5124131131501 its reverse (1051311314215), we get a palindrome (6175442445716).
The spelling of 5124131131501 in words is "five trillion, one hundred twenty-four billion, one hundred thirty-one million, one hundred thirty-one thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •