Nerdulator> put something in

Recognised as Number

-7,999,352,001

  • Negative
  • Odd
  • 10 digits

-7,999,352,001 is an odd 10-digit integer and the negative of 7,999,352,001. It has 6 divisors and a digital root of 9.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value7,999,352,001
Digit count10
Digit sum45
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3^2 × 888,816,889
Distinct prime factors23, 888,816,889
Number of divisors6
Sum of divisors σ(n)11,554,619,570
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 888,816,889, 2,666,450,667, 7,999,352,0016 in total

Arithmetic

Previous number-7,999,352,002
Next number-7,999,352,000
Square63,989,632,435,902,704,001
Cube-511,875,594,269,392,799,491,710,056,001
Cube root-1,999.945998625
Reciprocal-1.25010126 × 10^-10

Representations

Decimal-7,999,352,001
Binary11101110011001100011011001100000133 bits
Octal73463066301
Hexadecimal1DCCC6CC1
Base 363OALVI9
In wordsminus seven billion, nine hundred and ninety-nine million, three hundred and fifty-two thousand and one
Ordinalminus seven billion, nine hundred and ninety-nine million, three hundred and fifty-two thousand and first
Scientific notation-7.999352 × 10^9
Engineering notation-7.999352 × 10^9

In other bases

Ternary202122111012012000100base 3; the most digit-efficient integer base after e: 21 digits
Quinary112340313231001base 5; one hand: 15 digits
Septenary402142240644base 7: 12 digits
Nonary22574165010base 9; each digit is two ternary digits: 11 digits
Duodecimal1672b72769base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 10 digits
Vigesimal64jfj001base 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal10:17:14:2:13:21base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT1T0101TTTT11T11000T00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001100111011101001001011101000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111111111111111111111111111000100011001100111001001100111111
Bit length33 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits16within that length
Bit parityodd17 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 32worth 4,294,967,296
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes501 dc cc 6c c1
Gray code100110010101010100101101010100001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111111111111111111111111111111000100011001100111001001100111111two's complement
One's complement0000000000000000000000000000000111011100110011000110110011000000at 64 bits, every bit flipped
Bits reversed1111110011001001110011001100010001111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111110001000110011001110010011001111111at 64 bits, wrapping
Shifted left by 1-1110111001100110001101100110000010= -15,998,704,002, no wrap
Shifted right by 1-11101110011001100011011001100001= -3,999,676,000, discarding the low bit
These bits as a double3.95220501 × 10^-314IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+7,999,352,003
Nearest square below7,999,334,721
Nearest square above7,999,513,600

Powers & multiples

-7,999,352,001 to the power 263,989,632,435,902,704,001
-7,999,352,001 to the power 3-511,875,594,269,392,799,491,710,056,001
-7,999,352,001 to the power 44,094,673,059,281,931,423,669,002,619,383,421,408,001
-7,999,352,001 to the power 5-32754731130207709757071414865… (51 digits)
First ten multiples-7,999,352,001, -15,998,704,002, -23,998,056,003, -31,997,408,004, -39,996,760,005, -47,996,112,006, -55,995,464,007, -63,994,816,008, -71,994,168,009, -79,993,520,010
Powers of twoBetween 2^32 (4,294,967,296) and 2^33 (8,589,934,592)

Divisibility tests

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

As a percentage & fraction

As a percentage-799,935,200,100%
-7,999,352,001% as a decimal-79,993,520.01
-7,999,352,001% of 100-7,999,352,001
-7,999,352,001% of 1,000-79,993,520,010
As a fraction of 100-7,999,352,001/100

Keep nerding

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

Also reads as

7999352001 (identifier)

  • 10 characters
  • Checksum fails

7999352001 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 “-7999352001” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.