Base | Representation |
---|---|
bin | 101000000111100010101… |
… | …0101100011100000101101 |
3 | 201112002221222112102011022 |
4 | 1100033011111203200231 |
5 | 1210314131433142142 |
6 | 15420552235303525 |
7 | 1106232650014112 |
oct | 120170525434055 |
9 | 21462858472138 |
10 | 5513753802797 |
11 | 1836408307629 |
12 | 750728baaba5 |
13 | 30cc38810396 |
14 | 150c1d4b6909 |
15 | 9865aa556d2 |
hex | 503c556382d |
5513753802797 has 2 divisors, whose sum is σ = 5513753802798. Its totient is φ = 5513753802796.
The previous prime is 5513753802743. The next prime is 5513753802839. The reversal of 5513753802797 is 7972083573155.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5218615856041 + 295137946756 = 2284429^2 + 543266^2 .
It is a cyclic number.
It is not a de Polignac number, because 5513753802797 - 220 = 5513752754221 is a prime.
It is a super-3 number, since 3×55137538027973 (a number of 39 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (5513753802737) 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, 2756876901398 + 2756876901399.
It is an arithmetic number, because the mean of its divisors is an integer number (2756876901399).
Almost surely, 25513753802797 is an apocalyptic number.
It is an amenable number.
5513753802797 is a deficient number, since it is larger than the sum of its proper divisors (1).
5513753802797 is an equidigital number, since it uses as much as digits as its factorization.
5513753802797 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 55566000, while the sum is 62.
The spelling of 5513753802797 in words is "five trillion, five hundred thirteen billion, seven hundred fifty-three million, eight hundred two thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •