Base | Representation |
---|---|
bin | 1001010010111010100010… |
… | …0101001000001001011101 |
3 | 1100012002001002022122022002 |
4 | 2110232220211020021131 |
5 | 2314423144202032143 |
6 | 33423131450532045 |
7 | 2103260615234132 |
oct | 224565045101135 |
9 | 40162032278262 |
10 | 10220555502173 |
11 | 329057114a245 |
12 | 119098b437025 |
13 | 591a42c6b023 |
14 | 27496b1b8589 |
15 | 12acd7cb15b8 |
hex | 94ba894825d |
10220555502173 has 2 divisors, whose sum is σ = 10220555502174. Its totient is φ = 10220555502172.
The previous prime is 10220555502163. The next prime is 10220555502203. The reversal of 10220555502173 is 37120555502201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7957014189124 + 2263541313049 = 2820818^2 + 1504507^2 .
It is an emirp because it is prime and its reverse (37120555502201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 10220555502173 - 238 = 9945677595229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10220555502163) 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, 5110277751086 + 5110277751087.
It is an arithmetic number, because the mean of its divisors is an integer number (5110277751087).
Almost surely, 210220555502173 is an apocalyptic number.
It is an amenable number.
10220555502173 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220555502173 is an equidigital number, since it uses as much as digits as its factorization.
10220555502173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 105000, while the sum is 38.
The spelling of 10220555502173 in words is "ten trillion, two hundred twenty billion, five hundred fifty-five million, five hundred two thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •