Recognised as Number
-92,137
- Negative
- Odd
- 5 digits
-92,137 is an odd 5-digit integer and the negative of 92,137. It has 4 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value92,137
Digit count5
Digit sum22
Digit product378
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 199 × 463
Distinct prime factors2199, 463
Number of divisors4
Sum of divisors σ(n)92,800
SquarefreeYesno repeated prime factor
All divisors1, 199, 463, 92,1374 in total
Arithmetic
Representations
Decimal-92,137
Binary1011001111110100117 bits
Octal263751
Hexadecimal167E9
Base 361Z3D
In wordsminus ninety-two thousand, one hundred and thirty-seven
Ordinalminus ninety-two thousand, one hundred and thirty-seventh
Scientific notation-9.2137 × 10^4
Engineering notation-92.137 × 10^3
In other bases
Ternary11200101111base 3; the most digit-efficient integer base after e: 11 digits
Quinary10422022base 5; one hand: 8 digits
Septenary532423base 7: 6 digits
Nonary150344base 9; each digit is two ternary digits: 6 digits
Duodecimal453a1base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalba6hbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal25:35:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT11100T0TTTTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary111110100001101011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111101001100000010111
Bit length17 bitsto write the magnitude
Set bits11the population count, or Hamming weight
Zero bits6within that length
Bit parityodd11 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 16worth 65,536
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes301 67 e9
Gray code11101010000011101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111101001100000010111two's complement
64-bit1111111111111111111111111111111111111111111111101001100000010111two's complement
One's complement00000000000000010110011111101000at 32 bits, every bit flipped
Bits reversed11101000000110010111111111111111at 32 bits
Rotated left by 111111111111111010011000000101111at 32 bits, wrapping
Shifted left by 1-101100111111010010= -184,274, no wrap
Shifted right by 1-1011001111110101= -46,068, discarding the low bit
These bits as a double4.55217264 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-92,137 to the power 28,489,226,769
-92,137 to the power 3-782,171,886,815,353
-92,137 to the power 472,066,971,135,506,179,361
-92,137 to the power 5-6,640,034,519,512,132,847,784,457
First ten multiples-92,137, -184,274, -276,411, -368,548, -460,685, -552,822, -644,959, -737,096, -829,233, -921,370
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)
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 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-9,213,700%
-92,137% as a decimal-921.37
-92,137% of 100-92,137
-92,137% of 1,000-921,370
As a fraction of 100-92,137/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -92,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page