Base | Representation |
---|---|
bin | 100101001100110100001… |
… | …0110010011101111111001 |
3 | 200002202221011021002022212 |
4 | 1022121220112103233321 |
5 | 1132231414002321021 |
6 | 14512434220224505 |
7 | 1035246000625214 |
oct | 112315026235771 |
9 | 20082834232285 |
10 | 5112761760761 |
11 | 16a13457a7386 |
12 | 6a6a7969b135 |
13 | 2b11927c0125 |
14 | 13965d67877b |
15 | 8cedbeed85b |
hex | 4a668593bf9 |
5112761760761 has 8 divisors (see below), whose sum is σ = 5151927660000. Its totient is φ = 5073597940320.
The previous prime is 5112761760713. The next prime is 5112761760793. The reversal of 5112761760761 is 1670671672115.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5112761760761 - 218 = 5112761498617 is a prime.
It is a super-2 number, since 2×51127617607612 (a number of 26 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5112761762761) 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 in 7 ways as a sum of consecutive naturals, for example, 4611365 + ... + 5611613.
It is an arithmetic number, because the mean of its divisors is an integer number (643990957500).
Almost surely, 25112761760761 is an apocalyptic number.
It is an amenable number.
5112761760761 is a deficient number, since it is larger than the sum of its proper divisors (39165899239).
5112761760761 is a wasteful number, since it uses less digits than its factorization.
5112761760761 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1039399.
The product of its (nonzero) digits is 740880, while the sum is 50.
The spelling of 5112761760761 in words is "five trillion, one hundred twelve billion, seven hundred sixty-one million, seven hundred sixty thousand, seven hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •