Base | Representation |
---|---|
bin | 110010001001001011101101… |
… | …100100011110000100101101 |
3 | 1001220211210012012011020021212 |
4 | 302021023231210132010231 |
5 | 212401204323343302343 |
6 | 2101011345022004205 |
7 | 64311003441205526 |
oct | 6211135544360455 |
9 | 1056753165136255 |
10 | 220533376540973 |
11 | 642a5752845041 |
12 | 20898a19716665 |
13 | 96092924868c2 |
14 | 3c65c2db3184d |
15 | 1a768a4d03c18 |
hex | c892ed91e12d |
220533376540973 has 2 divisors, whose sum is σ = 220533376540974. Its totient is φ = 220533376540972.
The previous prime is 220533376540891. The next prime is 220533376541003. The reversal of 220533376540973 is 379045673335022.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 217576276718089 + 2957099822884 = 14750467^2 + 1719622^2 .
It is a cyclic number.
It is not a de Polignac number, because 220533376540973 - 216 = 220533376475437 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (220533376540273) 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, 110266688270486 + 110266688270487.
It is an arithmetic number, because the mean of its divisors is an integer number (110266688270487).
Almost surely, 2220533376540973 is an apocalyptic number.
It is an amenable number.
220533376540973 is a deficient number, since it is larger than the sum of its proper divisors (1).
220533376540973 is an equidigital number, since it uses as much as digits as its factorization.
220533376540973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 85730400, while the sum is 59.
The spelling of 220533376540973 in words is "two hundred twenty trillion, five hundred thirty-three billion, three hundred seventy-six million, five hundred forty thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •