Recognised as Number
-149,169
- Negative
- Odd
- 6 digits
-149,169 is an odd 6-digit integer and the negative of 149,169. It has 8 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value149,169
Digit count6
Digit sum30
Digit product1,944
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 × 19 × 2,617
Distinct prime factors33, 19, 2,617
Number of divisors8
Sum of divisors σ(n)209,440
SquarefreeYesno repeated prime factor
All divisors1, 3, 19, 57, 2,617, 7,851, 49,723, 149,1698 in total
Arithmetic
Representations
Decimal-149,169
Binary10010001101011000118 bits
Octal443261
Hexadecimal246B1
Base 36373L
In wordsminus one hundred and forty-nine thousand, one hundred and sixty-nine
Ordinalminus one hundred and forty-nine thousand, one hundred and sixty-ninth
Scientific notation-1.49169 × 10^5
Engineering notation-149.169 × 10^3
In other bases
Ternary21120121210base 3; the most digit-efficient integer base after e: 11 digits
Quinary14233134base 5; one hand: 8 digits
Septenary1160616base 7: 7 digits
Nonary246553base 9; each digit is two ternary digits: 6 digits
Duodecimal723a9base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalici9base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:26:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0111T1011T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100100101010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011100101001111
Bit length18 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits10within that length
Bit parityeven8 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 46 b1
Gray code110110010111101001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011100101001111two's complement
64-bit1111111111111111111111111111111111111111111111011011100101001111two's complement
One's complement00000000000000100100011010110000at 32 bits, every bit flipped
Bits reversed11110010100111011011111111111111at 32 bits
Rotated left by 111111111111110110111001010011111at 32 bits, wrapping
Shifted left by 1-1001000110101100010= -298,338, no wrap
Shifted right by 1-10010001101011001= -74,584, discarding the low bit
These bits as a double7.36992783 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-149,169 to the power 222,251,390,561
-149,169 to the power 3-3,319,217,678,593,809
-149,169 to the power 4495,124,381,898,159,894,721
-149,169 to the power 5-73,857,208,923,366,613,335,636,849
First ten multiples-149,169, -298,338, -447,507, -596,676, -745,845, -895,014, -1,044,183, -1,193,352, -1,342,521, -1,491,690
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 4
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 3
Divisible by 10No, remainder 9
Divisible by 11No, remainder 9
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-14,916,900%
-149,169% as a decimal-1,491.69
-149,169% of 100-149,169
-149,169% of 1,000-1,491,690
As a fraction of 100-149,169/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -149,169
Nerdulate something else
Nothing in mind? Surprise me · today’s page