Base | Representation |
---|---|
bin | 100101110110101000010… |
… | …1100100000000110101101 |
3 | 200102100201022001121020102 |
4 | 1023231100230200012231 |
5 | 1140214320131113243 |
6 | 15022004524000445 |
7 | 1044605160611114 |
oct | 113552054400655 |
9 | 20370638047212 |
10 | 5202559238573 |
11 | 1726436072564 |
12 | 70035a690125 |
13 | 2b97a3684098 |
14 | 13db3b6d8c7b |
15 | 904e56c39b8 |
hex | 4bb50b201ad |
5202559238573 has 2 divisors, whose sum is σ = 5202559238574. Its totient is φ = 5202559238572.
The previous prime is 5202559238483. The next prime is 5202559238599. The reversal of 5202559238573 is 3758329552025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5010734510089 + 191824728484 = 2238467^2 + 437978^2 .
It is a cyclic number.
It is not a de Polignac number, because 5202559238573 - 234 = 5185379369389 is a prime.
It is a super-2 number, since 2×52025592385732 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5202559208573) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2601279619286 + 2601279619287.
It is an arithmetic number, because the mean of its divisors is an integer number (2601279619287).
Almost surely, 25202559238573 is an apocalyptic number.
It is an amenable number.
5202559238573 is a deficient number, since it is larger than the sum of its proper divisors (1).
5202559238573 is an equidigital number, since it uses as much as digits as its factorization.
5202559238573 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 22680000, while the sum is 56.
The spelling of 5202559238573 in words is "five trillion, two hundred two billion, five hundred fifty-nine million, two hundred thirty-eight thousand, five hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •