Recognised as Number
-164,067
- Negative
- Odd
- 6 digits
-164,067 is an odd 6-digit integer and the negative of 164,067. It has 8 divisors and a digital root of 6.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value164,067
Digit count6
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 17 × 3,217
Distinct prime factors33, 17, 3,217
Number of divisors8
Sum of divisors σ(n)231,696
SquarefreeYesno repeated prime factor
All divisors1, 3, 17, 51, 3,217, 9,651, 54,689, 164,0678 in total
Arithmetic
Representations
Decimal-164,067
Binary10100000001110001118 bits
Octal500343
Hexadecimal280E3
Base 363ILF
In wordsminus one hundred and sixty-four thousand and sixty-seven
Ordinalminus one hundred and sixty-four thousand and sixty-seventh
Scientific notation-1.64067 × 10^5
Engineering notation-164.067 × 10^3
In other bases
Ternary22100001120base 3; the most digit-efficient integer base after e: 11 digits
Quinary20222232base 5; one hand: 8 digits
Septenary1252221base 7: 7 digits
Nonary270046base 9; each digit is two ternary digits: 6 digits
Duodecimal7ab43base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal10a37base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal45:34:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01T000T1110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000001101101101base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111010111111100011101
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 17worth 131,072
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes302 80 e3
Gray code111100000010010010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111010111111100011101two's complement
64-bit1111111111111111111111111111111111111111111111010111111100011101two's complement
One's complement00000000000000101000000011100010at 32 bits, every bit flipped
Bits reversed10111000111111101011111111111111at 32 bits
Rotated left by 111111111111110101111111000111011at 32 bits, wrapping
Shifted left by 1-1010000000111000110= -328,134, no wrap
Shifted right by 1-10100000001110010= -82,033, discarding the low bit
These bits as a double8.10598683 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-164,067 to the power 226,917,980,489
-164,067 to the power 3-4,416,352,304,888,763
-164,067 to the power 4724,577,673,606,184,679,121
-164,067 to the power 5-118,879,285,175,545,901,749,345,107
First ten multiples-164,067, -328,134, -492,201, -656,268, -820,335, -984,402, -1,148,469, -1,312,536, -1,476,603, -1,640,670
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 1
Divisible by 8No, remainder 3
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-16,406,700%
-164,067% as a decimal-1,640.67
-164,067% of 100-164,067
-164,067% of 1,000-1,640,670
As a fraction of 100-164,067/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -164,067
Nerdulate something else
Nothing in mind? Surprise me · today’s page