Recognised as Number
-146,127
- Negative
- Odd
- 6 digits
-146,127 is an odd 6-digit integer and the negative of 146,127. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value146,127
Digit count6
Digit sum21
Digit product336
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 67 × 727
Distinct prime factors33, 67, 727
Number of divisors8
Sum of divisors σ(n)198,016
SquarefreeYesno repeated prime factor
All divisors1, 3, 67, 201, 727, 2,181, 48,709, 146,1278 in total
Arithmetic
Representations
Decimal-146,127
Binary10001110101100111118 bits
Octal435317
Hexadecimal23ACF
Base 3634R3
In wordsminus one hundred and forty-six thousand, one hundred and twenty-seven
Ordinalminus one hundred and forty-six thousand, one hundred and twenty-seventh
Scientific notation-1.46127 × 10^5
Engineering notation-146.127 × 10^3
In other bases
Ternary21102110010base 3; the most digit-efficient integer base after e: 11 digits
Quinary14134002base 5; one hand: 8 digits
Septenary1146012base 7: 7 digits
Nonary242403base 9; each digit is two ternary digits: 6 digits
Duodecimal70693base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimali567base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal40:35:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1TTT1TT00T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100010101110001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011100010100110001
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 3a cf
Gray code110010011110101000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011100010100110001two's complement
64-bit1111111111111111111111111111111111111111111111011100010100110001two's complement
One's complement00000000000000100011101011001110at 32 bits, every bit flipped
Bits reversed10001100101000111011111111111111at 32 bits
Rotated left by 111111111111110111000101001100011at 32 bits, wrapping
Shifted left by 1-1000111010110011110= -292,254, no wrap
Shifted right by 1-10001110101101000= -73,063, discarding the low bit
These bits as a double7.21963306 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-146,127 to the power 221,353,100,129
-146,127 to the power 3-3,120,264,462,550,383
-146,127 to the power 4455,954,885,119,099,816,641
-146,127 to the power 5-66,627,319,497,798,698,906,299,407
First ten multiples-146,127, -292,254, -438,381, -584,508, -730,635, -876,762, -1,022,889, -1,169,016, -1,315,143, -1,461,270
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 3
Divisible by 12No, remainder 3
Divisible by 100No, remainder 27
As a percentage & fraction
As a percentage-14,612,700%
-146,127% as a decimal-1,461.27
-146,127% of 100-146,127
-146,127% of 1,000-1,461,270
As a fraction of 100-146,127/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -146,127
Nerdulate something else
Nothing in mind? Surprise me · today’s page