Base | Representation |
---|---|
bin | 100100101111110110001… |
… | …0001011001001110011101 |
3 | 122212211100112220102021022 |
4 | 1021133230101121032131 |
5 | 1130222011420234144 |
6 | 14424105122213525 |
7 | 1030614231252122 |
oct | 111375421311635 |
9 | 18784315812238 |
10 | 5050550555549 |
11 | 1677a211370a4 |
12 | 6969b71b42a5 |
13 | 2a8359c0a2b5 |
14 | 13663b26c749 |
15 | 8b59a5b8cee |
hex | 497ec45939d |
5050550555549 has 2 divisors, whose sum is σ = 5050550555550. Its totient is φ = 5050550555548.
The previous prime is 5050550555461. The next prime is 5050550555563. The reversal of 5050550555549 is 9455550550505.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3138718919449 + 1911831636100 = 1771643^2 + 1382690^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5050550555549 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5050550555549.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5050550555749) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2525275277774 + 2525275277775.
It is an arithmetic number, because the mean of its divisors is an integer number (2525275277775).
Almost surely, 25050550555549 is an apocalyptic number.
It is an amenable number.
5050550555549 is a deficient number, since it is larger than the sum of its proper divisors (1).
5050550555549 is an equidigital number, since it uses as much as digits as its factorization.
5050550555549 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14062500, while the sum is 53.
The spelling of 5050550555549 in words is "five trillion, fifty billion, five hundred fifty million, five hundred fifty-five thousand, five hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •