Base | Representation |
---|---|
bin | 101000011000111100000… |
… | …0111110010010100110001 |
3 | 201122200101121112222121212 |
4 | 1100301320013302110301 |
5 | 1211422134420202424 |
6 | 15450051321525505 |
7 | 1112024520265253 |
oct | 120617007622461 |
9 | 21580347488555 |
10 | 5551113053489 |
11 | 1850239668623 |
12 | 757a14643895 |
13 | 313610753093 |
14 | 152965075cd3 |
15 | 995e57ad10e |
hex | 50c781f2531 |
5551113053489 has 2 divisors, whose sum is σ = 5551113053490. Its totient is φ = 5551113053488.
The previous prime is 5551113053399. The next prime is 5551113053513. The reversal of 5551113053489 is 9843503111555.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5266588959025 + 284524094464 = 2294905^2 + 533408^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5551113053489 is a prime.
It is a super-2 number, since 2×55511130534892 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5551118053489) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2775556526744 + 2775556526745.
It is an arithmetic number, because the mean of its divisors is an integer number (2775556526745).
Almost surely, 25551113053489 is an apocalyptic number.
It is an amenable number.
5551113053489 is a deficient number, since it is larger than the sum of its proper divisors (1).
5551113053489 is an equidigital number, since it uses as much as digits as its factorization.
5551113053489 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1620000, while the sum is 50.
The spelling of 5551113053489 in words is "five trillion, five hundred fifty-one billion, one hundred thirteen million, fifty-three thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •