Base | Representation |
---|---|
bin | 10000000000100011000… |
… | …10010000000000110001 |
3 | 1221120202221010101212221 |
4 | 20000101202100000301 |
5 | 33003000300130131 |
6 | 1100404532321041 |
7 | 54511515620365 |
oct | 10002142200061 |
9 | 1846687111787 |
10 | 550050005041 |
11 | 1a2302985029 |
12 | 8a72a773181 |
13 | 3cb3c378284 |
14 | 1c8a044d2a5 |
15 | e494aa4411 |
hex | 8011890031 |
550050005041 has 2 divisors, whose sum is σ = 550050005042. Its totient is φ = 550050005040.
The previous prime is 550050005027. The next prime is 550050005051. The reversal of 550050005041 is 140500050055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 513608722225 + 36441282816 = 716665^2 + 190896^2 .
It is a cyclic number.
It is not a de Polignac number, because 550050005041 - 215 = 550049972273 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 550050004997 and 550050005015.
It is not a weakly prime, because it can be changed into another prime (550050005051) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275025002520 + 275025002521.
It is an arithmetic number, because the mean of its divisors is an integer number (275025002521).
Almost surely, 2550050005041 is an apocalyptic number.
It is an amenable number.
550050005041 is a deficient number, since it is larger than the sum of its proper divisors (1).
550050005041 is an equidigital number, since it uses as much as digits as its factorization.
550050005041 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2500, while the sum is 25.
Adding to 550050005041 its reverse (140500050055), we get a palindrome (690550055096).
The spelling of 550050005041 in words is "five hundred fifty billion, fifty million, five thousand, forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •