Base | Representation |
---|---|
bin | 100101000111110100111… |
… | …1001100001110000001101 |
3 | 200001202021122212011001002 |
4 | 1022033221321201300031 |
5 | 1132042444342232031 |
6 | 14503503301430045 |
7 | 1034416364304521 |
oct | 112175171416015 |
9 | 20052248764032 |
10 | 5102050352141 |
11 | 1697849460566 |
12 | 6a498a40b325 |
13 | 2b01765ca812 |
14 | 138d24c4bd81 |
15 | 8cab1967ccb |
hex | 4a3e9e61c0d |
5102050352141 has 2 divisors, whose sum is σ = 5102050352142. Its totient is φ = 5102050352140.
The previous prime is 5102050352137. The next prime is 5102050352159. The reversal of 5102050352141 is 1412530502015.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5099444658025 + 2605694116 = 2258195^2 + 51046^2 .
It is a cyclic number.
It is not a de Polignac number, because 5102050352141 - 22 = 5102050352137 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5102050352101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2551025176070 + 2551025176071.
It is an arithmetic number, because the mean of its divisors is an integer number (2551025176071).
Almost surely, 25102050352141 is an apocalyptic number.
It is an amenable number.
5102050352141 is a deficient number, since it is larger than the sum of its proper divisors (1).
5102050352141 is an equidigital number, since it uses as much as digits as its factorization.
5102050352141 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6000, while the sum is 29.
Adding to 5102050352141 its reverse (1412530502015), we get a palindrome (6514580854156).
The spelling of 5102050352141 in words is "five trillion, one hundred two billion, fifty million, three hundred fifty-two thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •