Base | Representation |
---|---|
bin | 1001010111010000… |
… | …00000001100011101 |
3 | 110222022221122221202 |
4 | 10223220000030131 |
5 | 40243334433031 |
6 | 2150451205245 |
7 | 235366503512 |
oct | 45350001435 |
9 | 13868848852 |
10 | 5026874141 |
11 | 214a5a2a43 |
12 | b835a6825 |
13 | 6215aab53 |
14 | 359899309 |
15 | 1e64b42cb |
hex | 12ba0031d |
5026874141 has 2 divisors, whose sum is σ = 5026874142. Its totient is φ = 5026874140.
The previous prime is 5026874129. The next prime is 5026874173. The reversal of 5026874141 is 1414786205.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4468922500 + 557951641 = 66850^2 + 23621^2 .
It is a cyclic number.
It is not a de Polignac number, because 5026874141 - 226 = 4959765277 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 5026874095 and 5026874104.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5026873141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2513437070 + 2513437071.
It is an arithmetic number, because the mean of its divisors is an integer number (2513437071).
Almost surely, 25026874141 is an apocalyptic number.
It is an amenable number.
5026874141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5026874141 is an equidigital number, since it uses as much as digits as its factorization.
5026874141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 53760, while the sum is 38.
The square root of 5026874141 is about 70900.4523328307. The cubic root of 5026874141 is about 1713.0340831970.
The spelling of 5026874141 in words is "five billion, twenty-six million, eight hundred seventy-four thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.025 sec. • engine limits •