Base | Representation |
---|---|
bin | 100101110111000101010… |
… | …0011101011011011010001 |
3 | 200102110012221201121022001 |
4 | 1023232022203223123101 |
5 | 1140223312140113202 |
6 | 15022245122514001 |
7 | 1044641216152411 |
oct | 113561243533321 |
9 | 20373187647261 |
10 | 5203530004177 |
11 | 172689403908a |
12 | 70058b805901 |
13 | 2b98c98268bb |
14 | 13dbd05d6641 |
15 | 90550a2cd87 |
hex | 4bb8a8eb6d1 |
5203530004177 has 2 divisors, whose sum is σ = 5203530004178. Its totient is φ = 5203530004176.
The previous prime is 5203530004163. The next prime is 5203530004207. The reversal of 5203530004177 is 7714000353025.
5203530004177 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3349251369216 + 1854278634961 = 1830096^2 + 1361719^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5203530004177 is a prime.
It is not a weakly prime, because it can be changed into another prime (5203530004877) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2601765002088 + 2601765002089.
It is an arithmetic number, because the mean of its divisors is an integer number (2601765002089).
Almost surely, 25203530004177 is an apocalyptic number.
It is an amenable number.
5203530004177 is a deficient number, since it is larger than the sum of its proper divisors (1).
5203530004177 is an equidigital number, since it uses as much as digits as its factorization.
5203530004177 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 88200, while the sum is 37.
The spelling of 5203530004177 in words is "five trillion, two hundred three billion, five hundred thirty million, four thousand, one hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •