Recognised as Number
-118,405
- Negative
- Odd
- 6 digits
-118,405 is an odd 6-digit integer and the negative of 118,405. It has 16 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value118,405
Digit count6
Digit sum19
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 7 × 17 × 199
Distinct prime factors45, 7, 17, 199
Number of divisors16
Sum of divisors σ(n)172,800
SquarefreeYesno repeated prime factor
All divisors1, 5, 7, 17, 35, 85, 119, 199, 595, 995, 1,393, 3,383, 6,965, 16,915, 23,681, 118,40516 in total
Arithmetic
Representations
Decimal-118,405
Binary1110011101000010117 bits
Octal347205
Hexadecimal1CE85
Base 362JD1
In wordsminus one hundred and eighteen thousand, four hundred and five
Ordinalminus one hundred and eighteen thousand, four hundred and fifth
Scientific notation-1.18405 × 10^5
Engineering notation-118.405 × 10^3
In other bases
Ternary20000102101base 3; the most digit-efficient integer base after e: 11 digits
Quinary12242110base 5; one hand: 8 digits
Septenary1002130base 7: 7 digits
Nonary200371base 9; each digit is two ternary digits: 6 digits
Duodecimal58631base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimaleg05base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal32:53:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT10000TT1T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100111011010001111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111100011000101111011
Bit length17 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits8within that length
Bit parityodd9 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 ce 85
Gray code10010100111000111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111100011000101111011two's complement
64-bit1111111111111111111111111111111111111111111111100011000101111011two's complement
One's complement00000000000000011100111010000100at 32 bits, every bit flipped
Bits reversed11011110100011000111111111111111at 32 bits
Rotated left by 111111111111111000110001011110111at 32 bits, wrapping
Shifted left by 1-111001110100001010= -236,810, no wrap
Shifted right by 1-1110011101000011= -59,202, discarding the low bit
These bits as a double5.84998428 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-118,405 to the power 214,019,744,025
-118,405 to the power 3-1,660,007,791,280,125
-118,405 to the power 4196,553,222,526,523,200,625
-118,405 to the power 5-23,272,884,313,252,979,570,003,125
First ten multiples-118,405, -236,810, -355,215, -473,620, -592,025, -710,430, -828,835, -947,240, -1,065,645, -1,184,050
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 5Yes
Divisible by 6No, remainder 1
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 1
Divisible by 10No, remainder 5
Divisible by 11No, remainder 1
Divisible by 12No, remainder 1
Divisible by 100No, remainder 5
As a percentage & fraction
As a percentage-11,840,500%
-118,405% as a decimal-1,184.05
-118,405% of 100-118,405
-118,405% of 1,000-1,184,050
As a fraction of 100-118,405/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -118,405
Nerdulate something else
Nothing in mind? Surprise me · today’s page