Base | Representation |
---|---|
bin | 10000000001011110101… |
… | …01110001000011010101 |
3 | 1221122001210001021012212 |
4 | 20000233111301003111 |
5 | 33010011303031411 |
6 | 1100530314123205 |
7 | 54530100126422 |
oct | 10005725610325 |
9 | 1848053037185 |
10 | 550550048981 |
11 | 1a253a171489 |
12 | 8a84a120505 |
13 | 3cbbbb4736a |
14 | 1c90aa16d49 |
15 | e4c392a68b |
hex | 802f5710d5 |
550550048981 has 2 divisors, whose sum is σ = 550550048982. Its totient is φ = 550550048980.
The previous prime is 550550048959. The next prime is 550550049047. The reversal of 550550048981 is 189840055055.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 295963200625 + 254586848356 = 544025^2 + 504566^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-550550048981 is a prime.
It is a super-2 number, since 2×5505500489812 (a number of 24 digits) contains 22 as substring.
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 (550550048281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275275024490 + 275275024491.
It is an arithmetic number, because the mean of its divisors is an integer number (275275024491).
Almost surely, 2550550048981 is an apocalyptic number.
It is an amenable number.
550550048981 is a deficient number, since it is larger than the sum of its proper divisors (1).
550550048981 is an equidigital number, since it uses as much as digits as its factorization.
550550048981 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1440000, while the sum is 50.
The spelling of 550550048981 in words is "five hundred fifty billion, five hundred fifty million, forty-eight thousand, nine hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •