Base | Representation |
---|---|
bin | 100101110110011000010… |
… | …1000100000010100100101 |
3 | 200102022022210212111122022 |
4 | 1023230300220200110211 |
5 | 1140212214424214343 |
6 | 15021435310312525 |
7 | 1044555636435242 |
oct | 113546050402445 |
9 | 20368283774568 |
10 | 5202021319973 |
11 | 172618a467335 |
12 | 70022a4b8745 |
13 | 2b97190b395a |
14 | 13daca0b25c9 |
15 | 904b336a568 |
hex | 4bb30a20525 |
5202021319973 has 2 divisors, whose sum is σ = 5202021319974. Its totient is φ = 5202021319972.
The previous prime is 5202021319949. The next prime is 5202021319987. The reversal of 5202021319973 is 3799131202025.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4890281114404 + 311740205569 = 2211398^2 + 558337^2 .
It is a cyclic number.
It is not a de Polignac number, because 5202021319973 - 230 = 5200947578149 is a prime.
It is a super-2 number, since 2×52020213199732 (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 (5202021309973) 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, 2601010659986 + 2601010659987.
It is an arithmetic number, because the mean of its divisors is an integer number (2601010659987).
Almost surely, 25202021319973 is an apocalyptic number.
It is an amenable number.
5202021319973 is a deficient number, since it is larger than the sum of its proper divisors (1).
5202021319973 is an equidigital number, since it uses as much as digits as its factorization.
5202021319973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 204120, while the sum is 44.
The spelling of 5202021319973 in words is "five trillion, two hundred two billion, twenty-one million, three hundred nineteen thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.109 sec. • engine limits •