Base | Representation |
---|---|
bin | 11011100010010001001110… |
… | …01000100101001110101001 |
3 | 21221101121222122121121211202 |
4 | 31301020213020211032221 |
5 | 30414032131002000243 |
6 | 332440443245533545 |
7 | 15516446561412116 |
oct | 1561104710451651 |
9 | 257347878547752 |
10 | 60551105500073 |
11 | 18325641544181 |
12 | 695b2628742b5 |
13 | 27a2c387c4226 |
14 | 10d499101b90d |
15 | 70011714b4b8 |
hex | 3712272253a9 |
60551105500073 has 2 divisors, whose sum is σ = 60551105500074. Its totient is φ = 60551105500072.
The previous prime is 60551105500057. The next prime is 60551105500147. The reversal of 60551105500073 is 37000550115506.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 51012563566864 + 9538541933209 = 7142308^2 + 3088453^2 .
It is a cyclic number.
It is not a de Polignac number, because 60551105500073 - 24 = 60551105500057 is a prime.
It is a super-2 number, since 2×605511055000732 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (60551105500013) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 30275552750036 + 30275552750037.
It is an arithmetic number, because the mean of its divisors is an integer number (30275552750037).
Almost surely, 260551105500073 is an apocalyptic number.
It is an amenable number.
60551105500073 is a deficient number, since it is larger than the sum of its proper divisors (1).
60551105500073 is an equidigital number, since it uses as much as digits as its factorization.
60551105500073 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 78750, while the sum is 38.
Adding to 60551105500073 its reverse (37000550115506), we get a palindrome (97551655615579).
The spelling of 60551105500073 in words is "sixty trillion, five hundred fifty-one billion, one hundred five million, five hundred thousand, seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •