Base | Representation |
---|---|
bin | 101000011010110001011… |
… | …0010000100010001001101 |
3 | 201200001112222121212121022 |
4 | 1100311202302010101031 |
5 | 1212003220300134311 |
6 | 15451542120243525 |
7 | 1112224213651556 |
oct | 120654262042115 |
9 | 21601488555538 |
10 | 5555050005581 |
11 | 18519799a9a3a |
12 | 7587330105a5 |
13 | 313aba29b42b |
14 | 152c19c9732d |
15 | 9977622c5db |
hex | 50d62c8444d |
5555050005581 has 2 divisors, whose sum is σ = 5555050005582. Its totient is φ = 5555050005580.
The previous prime is 5555050005503. The next prime is 5555050005649. The reversal of 5555050005581 is 1855000505555.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4511945249956 + 1043104755625 = 2124134^2 + 1021325^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5555050005581 is a prime.
It is a super-2 number, since 2×55550500055812 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5555050005481) 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, 2777525002790 + 2777525002791.
It is an arithmetic number, because the mean of its divisors is an integer number (2777525002791).
Almost surely, 25555050005581 is an apocalyptic number.
It is an amenable number.
5555050005581 is a deficient number, since it is larger than the sum of its proper divisors (1).
5555050005581 is an equidigital number, since it uses as much as digits as its factorization.
5555050005581 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 625000, while the sum is 44.
The spelling of 5555050005581 in words is "five trillion, five hundred fifty-five billion, fifty million, five thousand, five hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •