Java Utililty Methods BigInteger to

if (bi.signum() < 0) {
    bi = new BigInteger(1, bi.toByteArray());
return bi;

return source;

BigInteger actual = b.mod(p);
if (actual.compareTo(p_half) > 0) {
    actual = actual.subtract(p);
return actual;

StringBuilder sb = new StringBuilder();
while (true) {
    BigInteger mod = value.mod(BASE);
    sb.insert(0, elements[mod.intValue()]);
    value = value.divide(BASE);
    if (value.equals(BigInteger.ZERO)) {
        break;
return sb.toString();

if (bigInteger.compareTo(BigInteger.valueOf(Long.MAX_VALUE)) == 1) {
    return Long.MAX_VALUE;
} else {
    return bigInteger.longValue();

String str = "";
for (int i = 0; i < kmerSize; i++) {
    int idx = biSequence.mod(BigInteger.valueOf(4)).intValue();
    if (idx == 0) {
        str = "A" + str;
    } else if (idx == 1) {
        str = "C" + str;
    } else if (idx == 2) {
...

if (value == null || value.compareTo(BigInteger.ZERO) < 0) {
    return BigInteger.ZERO;
return value;

String hexString = bi.toString(16);
if (hexString.length() < 16) {
    String zeroes = "000000000000000";
    hexString = zeroes.substring(0, 16 - hexString.length()) + hexString;
return hexString.toUpperCase();

byte[] value = number.toByteArray();
if (value.length > length + 1) {
    throw new IllegalArgumentException(
            "The given BigInteger does not fit into a byte array with the given length: " + value.length
                    + " > " + length);
byte[] result = new byte[length];
int i = value.length == length + 1 ? 1 : 0;
...

char[] chars = new char[sigchars];
for (int i = 0; i < sigchars; i++) {
    int maskpos = 16 * (sigchars - (i + 1));
    chars[i] = hashChars.charAt(
            big.and(CHAR_MASK.shiftLeft(maskpos)).shiftRight(maskpos).intValue() % hashChars.length());
return new String(chars);