Recognised as Number
-94,000,001
- Negative
- Odd
- 8 digits
-94,000,001 is an odd 8-digit integer and the negative of 94,000,001. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value94,000,001
Digit count8
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 139 × 676,259
Distinct prime factors2139, 676,259
Number of divisors4
Sum of divisors σ(n)94,676,400
SquarefreeYesno repeated prime factor
All divisors1, 139, 676,259, 94,000,0014 in total
Arithmetic
Previous number-94,000,002
Next number-94,000,000
Double-188,000,002
Half-47,000,000.5
Square8,836,000,188,000,001
Cube-830,584,026,508,000,282,000,001
Cube root-454.68359599≈
Negation94,000,001
Reciprocal-1.06382978 × 10^-8≈
Representations
Decimal-94,000,001
Binary10110011010010100111000000127 bits
Octal546451601
Hexadecimal59A5381
Base 361JYQV5
In wordsminus ninety-four million and one
Ordinalminus ninety-four million and first
Scientific notation-9.4000001 × 10^7
Engineering notation-94.000001 × 10^6
In other bases
Ternary20112212200202112base 3; the most digit-efficient integer base after e: 17 digits
Quinary143031000001base 5; one hand: 12 digits
Septenary2220662324base 7: 10 digits
Nonary215780675base 9; each digit is two ternary digits: 9 digits
Duodecimal27592195base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 8 digits
Vigesimal197a001base 20; hands and feet, and the Mayan and Yoruba systems: 7 digits
Sexagesimal7:15:11:6:41base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT1T11001010T1T0111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111101110101111110110000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111010011001011010110001111111
Bit length27 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits15within that length
Bit parityeven12 set bits, so even; not the same as the number itself being odd
Highest set bitbit 26worth 67,108,864
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes405 9a 53 81
Gray code111010101110111101001000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111010011001011010110001111111two's complement
64-bit1111111111111111111111111111111111111010011001011010110001111111two's complement
One's complement00000101100110100101001110000000at 32 bits, every bit flipped
Bits reversed11111110001101011010011001011111at 32 bits
Rotated left by 111110100110010110101100011111111at 32 bits, wrapping
Shifted left by 1-1011001101001010011100000010= -188,000,002, no wrap
Shifted right by 1-10110011010010100111000001= -47,000,000, discarding the low bit
These bits as a double4.64421712 × 10^-316≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-94,000,001 to the power 28,836,000,188,000,001
-94,000,001 to the power 3-830,584,026,508,000,282,000,001
-94,000,001 to the power 478,074,899,322,336,053,016,000,376,000,001
-94,000,001 to the power 5-73390406143744883058400883600… (41 digits)
First ten multiples-94,000,001, -188,000,002, -282,000,003, -376,000,004, -470,000,005, -564,000,006, -658,000,007, -752,000,008, -846,000,009, -940,000,010
Powers of twoBetween 2^26 (67,108,864) and 2^27 (134,217,728)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 1
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 1
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 5
Divisible by 100No, remainder 1
As a percentage & fraction
As a percentage-9,400,000,100%
-94,000,001% as a decimal-940,000.01
-94,000,001% of 100-94,000,001
-94,000,001% of 1,000-940,000,010
As a fraction of 100-94,000,001/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -94,000,001
Also reads as
94000001 (identifier)
- 8 characters
- Checksum fails
94000001 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.
Checksum tests
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X
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