Base | Representation |
---|---|
bin | 10000000000101001011… |
… | …01000010001011010001 |
3 | 1221120220122011010201111 |
4 | 20000110231002023101 |
5 | 33003102402213401 |
6 | 1100414111533321 |
7 | 54513032511535 |
oct | 10002455021321 |
9 | 1846818133644 |
10 | 550103163601 |
11 | 1a232a992922 |
12 | 8a74452a241 |
13 | 3cb4a39b244 |
14 | 1c8a7529bc5 |
15 | e4995a4e51 |
hex | 8014b422d1 |
550103163601 has 2 divisors, whose sum is σ = 550103163602. Its totient is φ = 550103163600.
The previous prime is 550103163517. The next prime is 550103163607. The reversal of 550103163601 is 106361301055.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 543870850576 + 6232313025 = 737476^2 + 78945^2 .
It is a cyclic number.
It is not a de Polignac number, because 550103163601 - 213 = 550103155409 is a prime.
It is a super-2 number, since 2×5501031636012 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (550103163607) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 275051581800 + 275051581801.
It is an arithmetic number, because the mean of its divisors is an integer number (275051581801).
Almost surely, 2550103163601 is an apocalyptic number.
It is an amenable number.
550103163601 is a deficient number, since it is larger than the sum of its proper divisors (1).
550103163601 is an equidigital number, since it uses as much as digits as its factorization.
550103163601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8100, while the sum is 31.
Adding to 550103163601 its reverse (106361301055), we get a palindrome (656464464656).
The spelling of 550103163601 in words is "five hundred fifty billion, one hundred three million, one hundred sixty-three thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •