Base | Representation |
---|---|
bin | 101010000010100000001… |
… | …1100100101000100001001 |
3 | 202110100112200002012221112 |
4 | 1110011000130211010021 |
5 | 1224130424413344133 |
6 | 20142142412220105 |
7 | 1134301400526056 |
oct | 124050034450411 |
9 | 22410480065845 |
10 | 5777812246793 |
11 | 19283a1427934 |
12 | 79394176a635 |
13 | 32bacb331a92 |
14 | 15d90d05602d |
15 | a0462b99648 |
hex | 54140725109 |
5777812246793 has 2 divisors, whose sum is σ = 5777812246794. Its totient is φ = 5777812246792.
The previous prime is 5777812246781. The next prime is 5777812246807. The reversal of 5777812246793 is 3976422187775.
5777812246793 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5617293426889 + 160518819904 = 2370083^2 + 400648^2 .
It is a cyclic number.
It is not a de Polignac number, because 5777812246793 - 214 = 5777812230409 is a prime.
It is a super-2 number, since 2×57778122467932 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (5777812249793) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2888906123396 + 2888906123397.
It is an arithmetic number, because the mean of its divisors is an integer number (2888906123397).
Almost surely, 25777812246793 is an apocalyptic number.
It is an amenable number.
5777812246793 is a deficient number, since it is larger than the sum of its proper divisors (1).
5777812246793 is an equidigital number, since it uses as much as digits as its factorization.
5777812246793 is an evil number, because the sum of its binary digits is even.
The product of its digits is 248935680, while the sum is 68.
The spelling of 5777812246793 in words is "five trillion, seven hundred seventy-seven billion, eight hundred twelve million, two hundred forty-six thousand, seven hundred ninety-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •