Recognised as Number
-146,125
- Negative
- Odd
- 6 digits
-146,125 is an odd 6-digit integer and the negative of 146,125. It has 16 divisors and a digital root of 1.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value146,125
Digit count6
Digit sum19
Digit product240
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 × 5^3 × 7 × 167
Distinct prime factors35, 7, 167
Number of divisors16
Sum of divisors σ(n)209,664
SquarefreeNohas a repeated prime factor
All divisors1, 5, 7, 25, 35, 125, 167, 175, 835, 875, 1,169, 4,175, 5,845, 20,875, 29,225, 146,12516 in total
Arithmetic
Representations
Decimal-146,125
Binary10001110101100110118 bits
Octal435315
Hexadecimal23ACD
Base 3634R1
In wordsminus one hundred and forty-six thousand, one hundred and twenty-five
Ordinalminus one hundred and forty-six thousand, one hundred and twenty-fifth
Scientific notation-1.46125 × 10^5
Engineering notation-146.125 × 10^3
In other bases
Ternary21102110001base 3; the most digit-efficient integer base after e: 11 digits
Quinary14134000base 5; one hand: 8 digits
Septenary1146010base 7: 7 digits
Nonary242401base 9; each digit is two ternary digits: 6 digits
Duodecimal70691base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali565base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:35:25base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTT1TT000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100010101110111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100010100110011
Bit length18 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits8within that length
Bit parityeven10 set bits, so even; 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 3a cd
Gray code110010011110101011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100010100110011two's complement
64-bit1111111111111111111111111111111111111111111111011100010100110011two's complement
One's complement00000000000000100011101011001100at 32 bits, every bit flipped
Bits reversed11001100101000111011111111111111at 32 bits
Rotated left by 111111111111110111000101001100111at 32 bits, wrapping
Shifted left by 1-1000111010110011010= -292,250, no wrap
Shifted right by 1-10001110101100111= -73,062, discarding the low bit
These bits as a double7.21953425 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-146,125 to the power 221,352,515,625
-146,125 to the power 3-3,120,136,345,703,125
-146,125 to the power 4455,929,923,515,869,140,625
-146,125 to the power 5-66,622,760,073,756,378,173,828,125
First ten multiples-146,125, -292,250, -438,375, -584,500, -730,625, -876,750, -1,022,875, -1,169,000, -1,315,125, -1,461,250
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 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 25
As a percentage & fraction
As a percentage-14,612,500%
-146,125% as a decimal-1,461.25
-146,125% of 100-146,125
-146,125% of 1,000-1,461,250
As a fraction of 100-146,125/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -146,125
Nerdulate something else
Nothing in mind? Surprise me · today’s page