Base | Representation |
---|---|
bin | 100100110000101000110… |
… | …0110010100100001001101 |
3 | 122212222202000201120200102 |
4 | 1021201101212110201031 |
5 | 1130234002114240414 |
6 | 14424545530540445 |
7 | 1031004323011253 |
oct | 111412146244115 |
9 | 18788660646612 |
10 | 5052250540109 |
11 | 1678713799713 |
12 | 6971b0597725 |
13 | 2a856b17c816 |
14 | 13675cd4c5d3 |
15 | 8b649967ede |
hex | 4985199484d |
5052250540109 has 2 divisors, whose sum is σ = 5052250540110. Its totient is φ = 5052250540108.
The previous prime is 5052250540091. The next prime is 5052250540213. The reversal of 5052250540109 is 9010450522505.
Together with previous prime (5052250540091) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 4111757896009 + 940492644100 = 2027747^2 + 969790^2 .
It is a cyclic number.
It is not a de Polignac number, because 5052250540109 - 212 = 5052250536013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5052250540009) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2526125270054 + 2526125270055.
It is an arithmetic number, because the mean of its divisors is an integer number (2526125270055).
Almost surely, 25052250540109 is an apocalyptic number.
It is an amenable number.
5052250540109 is a deficient number, since it is larger than the sum of its proper divisors (1).
5052250540109 is an equidigital number, since it uses as much as digits as its factorization.
5052250540109 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 90000, while the sum is 38.
The spelling of 5052250540109 in words is "five trillion, fifty-two billion, two hundred fifty million, five hundred forty thousand, one hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •