Recognised as Number
-189,397
- Negative
- Odd
- 6 digits
-189,397 is an odd 6-digit integer and the negative of 189,397. It has 8 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value189,397
Digit count6
Digit sum37
Digit product13,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 13 × 17 × 857
Distinct prime factors313, 17, 857
Number of divisors8
Sum of divisors σ(n)216,216
SquarefreeYesno repeated prime factor
All divisors1, 13, 17, 221, 857, 11,141, 14,569, 189,3978 in total
Arithmetic
Representations
Decimal-189,397
Binary10111000111101010118 bits
Octal561725
Hexadecimal2E3D5
Base 364251
In wordsminus one hundred and eighty-nine thousand, three hundred and ninety-seven
Ordinalminus one hundred and eighty-nine thousand, three hundred and ninety-seventh
Scientific notation-1.89397 × 10^5
Engineering notation-189.397 × 10^3
In other bases
Ternary100121210201base 3; the most digit-efficient integer base after e: 12 digits
Quinary22030042base 5; one hand: 8 digits
Septenary1416115base 7: 7 digits
Nonary317721base 9; each digit is two ternary digits: 6 digits
Duodecimal91731base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal13d9hbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal52:36:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0T1011TT10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010110110001111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111010001110000101011
Bit length18 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits7within that length
Bit parityodd11 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 e3 d5
Gray code111001001000111111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111010001110000101011two's complement
64-bit1111111111111111111111111111111111111111111111010001110000101011two's complement
One's complement00000000000000101110001111010100at 32 bits, every bit flipped
Bits reversed11010100001110001011111111111111at 32 bits
Rotated left by 111111111111110100011100001010111at 32 bits, wrapping
Shifted left by 1-1011100011110101010= -378,794, no wrap
Shifted right by 1-10111000111101011= -94,698, discarding the low bit
These bits as a double9.35745511 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-189,397 to the power 235,871,223,609
-189,397 to the power 3-6,793,902,137,873,773
-189,397 to the power 41,286,744,683,206,878,984,881
-189,397 to the power 5-243,705,582,765,333,259,099,506,757
First ten multiples-189,397, -378,794, -568,191, -757,588, -946,985, -1,136,382, -1,325,779, -1,515,176, -1,704,573, -1,893,970
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 1
Divisible by 4No, remainder 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 5
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 1
Divisible by 100No, remainder 97
As a percentage & fraction
As a percentage-18,939,700%
-189,397% as a decimal-1,893.97
-189,397% of 100-189,397
-189,397% of 1,000-1,893,970
As a fraction of 100-189,397/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -189,397
Nerdulate something else
Nothing in mind? Surprise me · today’s page