Recognised as Number
-145,173
- Negative
- Odd
- 6 digits
-145,173 is an odd 6-digit integer and the negative of 145,173. It has 16 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value145,173
Digit count6
Digit sum21
Digit product420
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 7 × 31 × 223
Distinct prime factors43, 7, 31, 223
Number of divisors16
Sum of divisors σ(n)229,376
SquarefreeYesno repeated prime factor
All divisors1, 3, 7, 21, 31, 93, 217, 223, 651, 669, 1,561, 4,683, 6,913, 20,739, 48,391, 145,17316 in total
Arithmetic
Representations
Decimal-145,173
Binary10001101110001010118 bits
Octal433425
Hexadecimal23715
Base 36340L
In wordsminus one hundred and forty-five thousand, one hundred and seventy-three
Ordinalminus one hundred and forty-five thousand, one hundred and seventy-third
Scientific notation-1.45173 × 10^5
Engineering notation-145.173 × 10^3
In other bases
Ternary21101010210base 3; the most digit-efficient integer base after e: 11 digits
Quinary14121143base 5; one hand: 8 digits
Septenary1143150base 7: 7 digits
Nonary241123base 9; each digit is two ternary digits: 6 digits
Duodecimal70019base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali2idbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:19:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TT0T0TT1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101101100100111111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100100011101011
Bit length18 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits9within that length
Bit parityodd9 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 37 15
Gray code110010110010011111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100100011101011two's complement
64-bit1111111111111111111111111111111111111111111111011100100011101011two's complement
One's complement00000000000000100011011100010100at 32 bits, every bit flipped
Bits reversed11010111000100111011111111111111at 32 bits
Rotated left by 111111111111110111001000111010111at 32 bits, wrapping
Shifted left by 1-1000110111000101010= -290,346, no wrap
Shifted right by 1-10001101110001011= -72,586, discarding the low bit
These bits as a double7.1724992 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-145,173 to the power 221,075,199,929
-145,173 to the power 3-3,059,549,999,292,717
-145,173 to the power 4444,164,052,047,321,605,041
-145,173 to the power 5-64,480,627,927,865,819,368,617,093
First ten multiples-145,173, -290,346, -435,519, -580,692, -725,865, -871,038, -1,016,211, -1,161,384, -1,306,557, -1,451,730
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 1
Divisible by 5No, remainder 3
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9No, remainder 3
Divisible by 10No, remainder 3
Divisible by 11No, remainder 6
Divisible by 12No, remainder 9
Divisible by 100No, remainder 73
As a percentage & fraction
As a percentage-14,517,300%
-145,173% as a decimal-1,451.73
-145,173% of 100-145,173
-145,173% of 1,000-1,451,730
As a fraction of 100-145,173/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -145,173
Nerdulate something else
Nothing in mind? Surprise me · today’s page