Nerdulator> put something in

Recognised as Number

-9,663,597,001

  • Negative
  • Odd
  • 10 digits

-9,663,597,001 is an odd 10-digit integer and the negative of 9,663,597,001. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value9,663,597,001
Digit count10
Digit sum46
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2,131 × 4,534,771
Distinct prime factors22,131, 4,534,771
Number of divisors4
Sum of divisors σ(n)9,668,133,904
SquarefreeYesno repeated prime factor
All divisors1, 2,131, 4,534,771, 9,663,597,0014 in total

Arithmetic

Previous number-9,663,597,002
Next number-9,663,597,000
Square93,385,106,997,736,194,001
Cube-902,436,039,921,387,598,137,217,791,001
Cube root-2,130.000000073
Reciprocal-1.03481136 × 10^-10

Representations

Decimal-9,663,597,001
Binary100011111111111110110010011100100134 bits
Octal107777544711
Hexadecimal23FFEC9C9
Base 364FTGF61
In wordsminus nine billion, six hundred and sixty-three million, five hundred and ninety-seven thousand and one
Ordinalminus nine billion, six hundred and sixty-three million, five hundred and ninety-seven thousand and first
Scientific notation-9.663597 × 10^9
Engineering notation-9.663597 × 10^9

In other bases

Ternary220221110202120222001base 3; the most digit-efficient integer base after e: 21 digits
Quinary124242340101001base 5; one hand: 15 digits
Septenary461321135122base 7: 12 digits
Nonary26843676861base 9; each digit is two ternary digits: 11 digits
Duodecimal1a5839b461base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits
Vigesimal7ajh9ca1base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal12:25:38:52:30:1base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT01T01TTTT1T011T00100Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1011000000000000010100101001001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111111111111111111111111110111000000000000010011011000110111
Bit length34 bitsto write the magnitude
Set bits22the population count, or Hamming weight
Zero bits12within that length
Bit parityeven22 set bits, so even; not the same as the number itself being odd
Highest set bitbit 33worth 8,589,934,592
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes502 3f fe c9 c9
Gray code1100100000000000011010110100101101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111111111111111111111111111110111000000000000010011011000110111two's complement
One's complement0000000000000000000000000000001000111111111111101100100111001000at 64 bits, every bit flipped
Bits reversed1110110001101100100000000000001110111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111101110000000000000100110110001101111at 64 bits, wrapping
Shifted left by 1-10001111111111111011001001110010010= -19,327,194,002, no wrap
Shifted right by 1-100011111111111110110010011100101= -4,831,798,500, discarding the low bit
These bits as a double4.77445129 × 10^-314IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+9,663,597,003
Nearest square below9,663,479,809
Nearest square above9,663,676,416

Powers & multiples

-9,663,597,001 to the power 293,385,106,997,736,194,001
-9,663,597,001 to the power 3-902,436,039,921,387,598,137,217,791,001
-9,663,597,001 to the power 48,720,778,208,978,637,469,117,411,031,601,108,388,001
-9,663,597,001 to the power 5-84274086146672112319629243361… (51 digits)
First ten multiples-9,663,597,001, -19,327,194,002, -28,990,791,003, -38,654,388,004, -48,317,985,005, -57,981,582,006, -67,645,179,007, -77,308,776,008, -86,972,373,009, -96,635,970,010
Powers of twoBetween 2^33 (8,589,934,592) and 2^34 (17,179,869,184)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 1
Divisible by 11No, remainder 3
Divisible by 12No, remainder 1
Divisible by 100No, remainder 1

As a percentage & fraction

As a percentage-966,359,700,100%
-9,663,597,001% as a decimal-96,635,970.01
-9,663,597,001% of 100-9,663,597,001
-9,663,597,001% of 1,000-96,635,970,010
As a fraction of 100-9,663,597,001/100

Keep nerding

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

Also reads as

9663597001 (identifier)

  • 10 characters
  • Checksum fails

9663597001 matches the shape of ISBN-10, 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-10Check digit does not matchmod 11 with weights 10 down to 1
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

Every value on this page was computed from “-9663597001” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.