Base | Representation |
---|---|
bin | 1001010110001101000010… |
… | …00010100011110100111101 |
3 | 2200202221202222121000222202 |
4 | 10223012201002203310331 |
5 | 10143224314300023143 |
6 | 111414233231321245 |
7 | 4220662156000625 |
oct | 453064102436475 |
9 | 80687688530882 |
10 | 20554120314173 |
11 | 6604a54088606 |
12 | 237b639380225 |
13 | b613259c9b44 |
14 | 510b790c3885 |
15 | 2599d6e4cab8 |
hex | 12b1a10a3d3d |
20554120314173 has 2 divisors, whose sum is σ = 20554120314174. Its totient is φ = 20554120314172.
The previous prime is 20554120314121. The next prime is 20554120314187. The reversal of 20554120314173 is 37141302145502.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 11938973699524 + 8615146614649 = 3455282^2 + 2935157^2 .
It is a cyclic number.
It is not a de Polignac number, because 20554120314173 - 26 = 20554120314109 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (20554120314073) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 10277060157086 + 10277060157087.
It is an arithmetic number, because the mean of its divisors is an integer number (10277060157087).
Almost surely, 220554120314173 is an apocalyptic number.
It is an amenable number.
20554120314173 is a deficient number, since it is larger than the sum of its proper divisors (1).
20554120314173 is an equidigital number, since it uses as much as digits as its factorization.
20554120314173 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 100800, while the sum is 38.
Adding to 20554120314173 its reverse (37141302145502), we get a palindrome (57695422459675).
The spelling of 20554120314173 in words is "twenty trillion, five hundred fifty-four billion, one hundred twenty million, three hundred fourteen thousand, one hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •