Recognised as Number
-94,000,004
- Negative
- Even
- 8 digits
-94,000,004 is an even 8-digit integer and the negative of 94,000,004. It has 24 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value94,000,004
Digit count8
Digit sum17
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 7 × 17 × 197,479
Distinct prime factors42, 7, 17, 197,479
Number of divisors24
Sum of divisors σ(n)199,059,840
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 7, 14, 17, 28, 34, 68, 119, 238, 476, 197,479, 394,958, 789,916, 1,382,353, 2,764,706, 3,357,143, 5,529,412, 6,714,286, 13,428,572, 23,500,001, 47,000,002, 94,000,00424 in total
Arithmetic
Previous number-94,000,005
Next number-94,000,003
Double-188,000,008
Half-47,000,002
Square8,836,000,752,000,016
Cube-830,584,106,032,004,512,000,064
Cube root-454.683600827≈
Negation94,000,004
Reciprocal-1.06382974 × 10^-8≈
Representations
Decimal-94,000,004
Binary10110011010010100111000010027 bits
Octal546451604
Hexadecimal59A5384
Base 361JYQV8
In wordsminus ninety-four million and four
Ordinalminus ninety-four million and fourth
Scientific notation-9.4000004 × 10^7
Engineering notation-94.000004 × 10^6
In other bases
Ternary20112212200202122base 3; the most digit-efficient integer base after e: 17 digits
Quinary143031000004base 5; one hand: 12 digits
Septenary2220662330base 7: 10 digits
Nonary215780678base 9; each digit is two ternary digits: 9 digits
Duodecimal27592198base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 8 digits
Vigesimal197a004base 20; hands and feet, and the Mayan and Yoruba systems: 7 digits
Sexagesimal7:15:11:6:44base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT1T11001010T1T0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111101110101111110110001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111010011001011010110001111100
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 even
Highest set bitbit 26worth 67,108,864
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes405 9a 53 84
Gray code111010101110111101001000110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111010011001011010110001111100two's complement
64-bit1111111111111111111111111111111111111010011001011010110001111100two's complement
One's complement00000101100110100101001110000011at 32 bits, every bit flipped
Bits reversed00111110001101011010011001011111at 32 bits
Rotated left by 111110100110010110101100011111001at 32 bits, wrapping
Shifted left by 1-1011001101001010011100001000= -188,000,008, no wrap
Shifted right by 1-10110011010010100111000010= -47,000,002, discarding the low bit
These bits as a double4.64421727 × 10^-316≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-94,000,004 to the power 28,836,000,752,000,016
-94,000,004 to the power 3-830,584,106,032,004,512,000,064
-94,000,004 to the power 478,074,909,289,344,848,256,024,064,000,256
-94,000,004 to the power 5-73390417854980528934456550401… (41 digits)
First ten multiples-94,000,004, -188,000,008, -282,000,012, -376,000,016, -470,000,020, -564,000,024, -658,000,028, -752,000,032, -846,000,036, -940,000,040
Powers of twoBetween 2^26 (67,108,864) and 2^27 (134,217,728)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 4
Divisible by 6No, remainder 2
Divisible by 7Yes
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10No, remainder 4
Divisible by 11No, remainder 10
Divisible by 12No, remainder 8
Divisible by 100No, remainder 4
As a percentage & fraction
As a percentage-9,400,000,400%
-94,000,004% as a decimal-940,000.04
-94,000,004% of 100-94,000,004
-94,000,004% of 1,000-940,000,040
As a fraction of 100-94,000,004/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,004
Also reads as
94000004 (identifier)
- 8 characters
- Checksum fails
94000004 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