Recognised as Number

9,957,344,336,671

Positive
Odd
Prime
13 digits

9,957,344,336,671 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,957,344,336,671

Digit count13

Digit sum67

Digit product308,629,440

Multiplicative persistence2times 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,957,344,336,671

Distinct prime factors19,957,344,336,671

Number of divisors2

Sum of divisors σ(n)9,957,344,336,672

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)9,957,344,336,670integers below n that share no factor with it

Carmichael function λ(n)9,957,344,336,670the 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,957,344,336,6712 in total

Arithmetic

Previous number9,957,344,336,670

Next number9,957,344,336,672

Double19,914,688,673,342

Half4,978,672,168,335.5

Square99,148,706,239,034,036,995,362,241

Cube987,257,808,557,502,212,273,376,507,513,505,039,711

Square root3,155,525.99999921≈irrational, shown to 9 decimal places

Cube root21,513.670294252≈

Negation-9,957,344,336,671

Reciprocal1.00428384 × 10^-13≈

Representations

Decimal9,957,344,336,671

Binary1001000011100101111111111000110110110001111144 bits

Octal220713776155437

Hexadecimal90E5FF8DB1F

Base 363J2C9Q68V

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

In wordsnine trillion, nine hundred and fifty-seven billion, three hundred and forty-four million, three hundred and thirty-six thousand, six hundred and seventy-one

Ordinalnine trillion, nine hundred and fifty-seven billion, three hundred and forty-four million, three hundred and thirty-six thousand, six hundred and seventy-first

Scientific notation9.95734434 × 10^12

Engineering notation9.957344 × 10^12

In other bases

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

Quinary2301120120122233141base 5; one hand: 19 digits

Septenary2045252163236644base 7: 16 digits

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

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

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

Sexagesimal3:33:25:13:36:22:24:31base 60; Babylonian, and still how an hour and a circle are divided: 8 digits

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

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

Bit-level

0000000000000000000010010000111001011111111110001101101100011111

Bit length44 bitsto write the magnitude

Set bits27the population count, or Hamming weight

Zero bits17within that length

Bit parityodd27 set bits, so odd; 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 0e 5f f8 db 1f

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

At each machine width

64-bit0000000000000000000010010000111001011111111110001101101100011111

One's complement1111111111111111111101101111000110100000000001110010010011100000at 64 bits, every bit flipped

Bits reversed1111100011011011000111111111101001110000100100000000000000000000at 64 bits

Rotated left by 10000000000000000000100100001110010111111111100011011011000111110at 64 bits, wrapping

Shifted left by 1100100001110010111111111100011011011000111110= 19,914,688,673,342, no wrap

Shifted right by 11001000011100101111111111000110110110001111= 4,978,672,168,335, discarding the low bit

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

Nearest landmarks

Next prime9,957,344,336,683+12

Previous prime9,957,344,336,647−24

Distance to nearest prime0, it is prime

Nearest square below9,957,338,025,625

Nearest square above9,957,344,336,676

Powers & multiples

9,957,344,336,671 to the power 299,148,706,239,034,036,995,362,241

9,957,344,336,671 to the power 3987,257,808,557,502,212,273,376,507,513,505,039,711

9,957,344,336,671 to the power 4983046594887426697322985923512… (52 digits)

9,957,344,336,671 to the power 5978853344428602904737368356199… (65 digits)

First ten multiples9,957,344,336,671, 19,914,688,673,342, 29,872,033,010,013, 39,829,377,346,684, 49,786,721,683,355, 59,744,066,020,026, 69,701,410,356,697, 79,658,754,693,368, 89,616,099,030,039, 99,573,443,366,710

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 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 4

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 6

Divisible by 12No, remainder 7

Divisible by 100No, remainder 71

Collatz (3n + 1) trajectory

Steps to reach 1351the total stopping time

Highest value reached2,069,420,391,827,584207× the starting value

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

First steps9,957,344,336,671 → 29,872,033,010,014 → 14,936,016,505,007 → 44,808,049,515,022 → 22,404,024,757,511 → 67,212,074,272,534 → 33,606,037,136,267 → 100,818,111,408,802 → 50,409,055,704,401 → 151,227,167,113,204 → …

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

As a percentage & fraction

As a percentage995,734,433,667,100%

9,957,344,336,671% as a decimal99,573,443,366.71

9,957,344,336,671% of 1009,957,344,336,671

9,957,344,336,671% of 1,00099,573,443,366,710

As a fraction of 1009,957,344,336,671/100

Read another way

As seconds315,529 years, 73 days and 16 hours

As bytes9.056 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,957,344,336,671

Nearby primes

9957344336671 (identifier)

13 characters
Checksum fails

9957344336671 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