Base | Representation |
---|---|
bin | 111110100110011101011010… |
… | …0001101101101010000000101 |
3 | 2200012200000101021220010022002 |
4 | 1331030322310031231100011 |
5 | 1034133221043231034302 |
6 | 5231042102234315045 |
7 | 223661454513655364 |
oct | 17514726415552005 |
9 | 2605600337803262 |
10 | 550643600643077 |
11 | 14a4a770434a977 |
12 | 51912503888a85 |
13 | 1a833612a70446 |
14 | 99d94147917db |
15 | 439d78504ec02 |
hex | 1f4ceb436d405 |
550643600643077 has 2 divisors, whose sum is σ = 550643600643078. Its totient is φ = 550643600643076.
The previous prime is 550643600642981. The next prime is 550643600643133. The reversal of 550643600643077 is 770346006346055.
It is an a-pointer prime, because the next prime (550643600643133) can be obtained adding 550643600643077 to its sum of digits (56).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 543029389546081 + 7614211096996 = 23302991^2 + 2759386^2 .
It is a cyclic number.
It is not a de Polignac number, because 550643600643077 - 236 = 550574881166341 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (550643600642077) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275321800321538 + 275321800321539.
It is an arithmetic number, because the mean of its divisors is an integer number (275321800321539).
Almost surely, 2550643600643077 is an apocalyptic number.
It is an amenable number.
550643600643077 is a deficient number, since it is larger than the sum of its proper divisors (1).
550643600643077 is an equidigital number, since it uses as much as digits as its factorization.
550643600643077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 38102400, while the sum is 56.
The spelling of 550643600643077 in words is "five hundred fifty trillion, six hundred forty-three billion, six hundred million, six hundred forty-three thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •