Recognised as Number

9,997,598,808,427

Positive
Odd
Prime
13 digits

9,997,598,808,427 is an odd 13-digit integer and a prime number. It has 2 divisors and a digital root of 4.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value9,997,598,808,427

Digit count13

Digit sum85

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation9,997,598,808,427

Distinct prime factors19,997,598,808,427

Number of divisors2

Sum of divisors σ(n)9,997,598,808,428

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)9,997,598,808,426integers below n that share no factor with it

Carmichael function λ(n)9,997,598,808,426the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 9,997,598,808,4272 in total

Arithmetic

Previous number9,997,598,808,426

Next number9,997,598,808,428

Double19,995,197,616,854

Half4,998,799,404,213.5

Square99,951,981,934,260,970,246,214,329

Cube999,279,815,485,884,506,780,405,276,418,053,350,483

Square root3,161,897.97565118≈irrational, shown to 9 decimal places

Cube root21,542.622358806≈

Negation-9,997,598,808,427

Reciprocal1.00024018 × 10^-13≈

Representations

Decimal9,997,598,808,427

Binary1001000101111011111101010011010110010110101144 bits

Octal221367724654553

Hexadecimal917BF53596B

Base 363JKU077FV

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsnine trillion, nine hundred and ninety-seven billion, five hundred and ninety-eight million, eight hundred and eight thousand, four hundred and twenty-seven

Ordinalnine trillion, nine hundred and ninety-seven billion, five hundred and ninety-eight million, eight hundred and eight thousand, four hundred and twenty-seventh

Scientific notation9.99759881 × 10^12

Engineering notation9.997599 × 10^12

In other bases

Ternary1022101202112211222002020011base 3; the most digit-efficient integer base after e: 28 digits

Quinary2302300040243332202base 5; one hand: 19 digits

Septenary2051205550505626base 7: 16 digits

Nonary38352484862204base 9; each digit is two ternary digits: 14 digits

Duodecimal11557277426b7base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 13 digits

Vigesimaljaac9cb117base 20; hands and feet, and the Mayan and Yoruba systems: 10 digits

Sexagesimal3:34:16:59:39:40:7:7base 60; Babylonian, and still how an hour and a circle are divided: 8 digits

Balanced ternary110T11TT10TT00TT00T01T1T0011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary110010110100011000011010101001010111010111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

0000000000000000000010010001011110111111010100110101100101101011

Bit length44 bitsto write the magnitude

Set bits26the population count, or Hamming weight

Zero bits18within that length

Bit parityeven26 set bits, so even; not the same as the number itself being odd

Highest set bitbit 43worth 8,796,093,022,208

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes609 17 bf 53 59 6b

Gray code11011001110001100000111110101111010111011110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit0000000000000000000010010001011110111111010100110101100101101011

One's complement1111111111111111111101101110100001000000101011001010011010010100at 64 bits, every bit flipped

Bits reversed1101011010011010110010101111110111101000100100000000000000000000at 64 bits

Rotated left by 10000000000000000000100100010111101111110101001101011001011010110at 64 bits, wrapping

Shifted left by 1100100010111101111110101001101011001011010110= 19,995,197,616,854, no wrap

Shifted right by 11001000101111011111101010011010110010110101= 4,998,799,404,213, discarding the low bit

These bits as a double4.93947011 × 10^-311≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime9,997,598,808,521+94

Previous prime9,997,598,808,391−36

Distance to nearest prime0, it is prime

Nearest square below9,997,592,638,609

Nearest square above9,997,598,962,404

Powers & multiples

9,997,598,808,427 to the power 299,951,981,934,260,970,246,214,329

9,997,598,808,427 to the power 3999,279,815,485,884,506,780,405,276,418,053,350,483

9,997,598,808,427 to the power 4999039869258683136702592039366… (52 digits)

9,997,598,808,427 to the power 5998799980647167639532099292265… (65 digits)

First ten multiples9,997,598,808,427, 19,995,197,616,854, 29,992,796,425,281, 39,990,395,233,708, 49,987,994,042,135, 59,985,592,850,562, 69,983,191,658,989, 79,980,790,467,416, 89,978,389,275,843, 99,975,988,084,270

Powers of twoBetween 2^43 (8,796,093,022,208) and 2^44 (17,592,186,044,416)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 2

Divisible by 6No, remainder 1

Divisible by 7No, remainder 6

Divisible by 8No, remainder 3

Divisible by 9No, remainder 4

Divisible by 10No, remainder 7

Divisible by 11No, remainder 10

Divisible by 12No, remainder 7

Divisible by 100No, remainder 27

Collatz (3n + 1) trajectory

Steps to reach 1426the total stopping time

Highest value reached44,989,194,637,9244× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps9,997,598,808,427 → 29,992,796,425,282 → 14,996,398,212,641 → 44,989,194,637,924 → 22,494,597,318,962 → 11,247,298,659,481 → 33,741,895,978,444 → 16,870,947,989,222 → 8,435,473,994,611 → 25,306,421,983,834 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage999,759,880,842,700%

9,997,598,808,427% as a decimal99,975,988,084.27

9,997,598,808,427% of 1009,997,598,808,427

9,997,598,808,427% of 1,00099,975,988,084,270

As a fraction of 1009,997,598,808,427/100

Read another way

As seconds316,804 years, 288 days and 4 hours

As bytes9.093 TiB

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Neighbouring numbers

Derived from 9,997,598,808,427

Nearby primes

9997598808427 (identifier)

13 characters
Checksum fails

9997598808427 matches the shape of ISBN-13 / EAN-13, Luhn (cards, IMEI). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.

Open this reading on its own page →

Checksum tests

ISBN-13 / EAN-13Check digit does not matchmod 10 with alternating weights 1 and 3

Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled

What this does not tell you

ExistenceNot checkedno network lookup is made, ever

Ownership or validity in useNot checked

Nerdulate something else

Nothing in mind? Surprise me · today’s page