Recognised as Number
-67,004,339
- Negative
- Odd
- 8 digits
-67,004,339 is an odd 8-digit integer and the negative of 67,004,339. It has 2 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value67,004,339
Digit count8
Digit sum32
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 × 67,004,339
Distinct prime factors167,004,339
Number of divisors2
Sum of divisors σ(n)67,004,340
SquarefreeYesno repeated prime factor
All divisors1, 67,004,3392 in total
Arithmetic
Previous number-67,004,340
Next number-67,004,338
Double-134,008,678
Half-33,502,169.5
Square4,489,581,444,826,921
Cube-300,821,437,097,292,811,010,219
Cube root-406.163577545≈
Negation67,004,339
Reciprocal-1.49244066 × 10^-8≈
Representations
Decimal-67,004,339
Binary1111111110011001111011001126 bits
Octal377463663
Hexadecimal3FE67B3
Base 3613W4VN
In wordsminus sixty-seven million, four thousand, three hundred and thirty-nine
Ordinalminus sixty-seven million, four thousand, three hundred and thirty-ninth
Scientific notation-6.7004339 × 10^7
Engineering notation-67.004339 × 10^6
In other bases
Ternary11200002011200012base 3; the most digit-efficient integer base after e: 17 digits
Quinary114123114324base 5; one hand: 12 digits
Septenary1442345633base 7: 10 digits
Nonary150064605base 9; each digit is two ternary digits: 9 digits
Duodecimal1a5337abbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 8 digits
Vigesimal10ifagjbase 20; hands and feet, and the Mayan and Yoruba systems: 7 digits
Sexagesimal5:10:12:18:59base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT111000T1T11100T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1100000001101110100001011101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111100000000011001100001001101
Bit length26 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits7within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 25worth 33,554,432
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes403 fe 67 b3
Gray code10000000010101010001101010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111100000000011001100001001101two's complement
64-bit1111111111111111111111111111111111111100000000011001100001001101two's complement
One's complement00000011111111100110011110110010at 32 bits, every bit flipped
Bits reversed10110010000110011000000000111111at 32 bits
Rotated left by 111111000000000110011000010011011at 32 bits, wrapping
Shifted left by 1-111111111001100111101100110= -134,008,678, no wrap
Shifted right by 1-1111111110011001111011010= -33,502,169, discarding the low bit
These bits as a double3.3104542 × 10^-316≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-67,004,339 to the power 24,489,581,444,826,921
-67,004,339 to the power 3-300,821,437,097,292,811,010,219
-67,004,339 to the power 420,156,341,549,734,183,491,191,646,340,241
-67,004,339 to the power 5-13505623421981745905320085853… (41 digits)
First ten multiples-67,004,339, -134,008,678, -201,013,017, -268,017,356, -335,021,695, -402,026,034, -469,030,373, -536,034,712, -603,039,051, -670,043,390
Powers of twoBetween 2^25 (33,554,432) and 2^26 (67,108,864)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 3
Divisible by 9No, remainder 5
Divisible by 10No, remainder 9
Divisible by 11No, remainder 6
Divisible by 12No, remainder 11
Divisible by 100No, remainder 39
As a percentage & fraction
As a percentage-6,700,433,900%
-67,004,339% as a decimal-670,043.39
-67,004,339% of 100-67,004,339
-67,004,339% of 1,000-670,043,390
As a fraction of 100-67,004,339/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -67,004,339
Also reads as
67004339 (identifier)
- 8 characters
- Checksum fails
67004339 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