Base | Representation |
---|---|
bin | 101110010101110001011… |
… | …1010010011000110011101 |
3 | 211112212100222011120011002 |
4 | 1130223202322103012131 |
5 | 1313322101301403302 |
6 | 21313504325040045 |
7 | 1225066323505601 |
oct | 134534272230635 |
9 | 24485328146132 |
10 | 6368948466077 |
11 | 203606840981a |
12 | 86a417b56025 |
13 | 3727877c4512 |
14 | 18038a023501 |
15 | b0a0e796c02 |
hex | 5cae2e9319d |
6368948466077 has 2 divisors, whose sum is σ = 6368948466078. Its totient is φ = 6368948466076.
The previous prime is 6368948466071. The next prime is 6368948466137. The reversal of 6368948466077 is 7706648498636.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5553591839236 + 815356626841 = 2356606^2 + 902971^2 .
It is a cyclic number.
It is not a de Polignac number, because 6368948466077 - 222 = 6368944271773 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 6368948465995 and 6368948466013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (6368948466071) 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 as a sum of consecutive naturals, namely, 3184474233038 + 3184474233039.
It is an arithmetic number, because the mean of its divisors is an integer number (3184474233039).
Almost surely, 26368948466077 is an apocalyptic number.
It is an amenable number.
6368948466077 is a deficient number, since it is larger than the sum of its proper divisors (1).
6368948466077 is an equidigital number, since it uses as much as digits as its factorization.
6368948466077 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1755758592, while the sum is 74.
The spelling of 6368948466077 in words is "six trillion, three hundred sixty-eight billion, nine hundred forty-eight million, four hundred sixty-six thousand, seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •