Recognised as Number
-149,767
- Negative
- Odd
- 6 digits
-149,767 is an odd 6-digit integer and the negative of 149,767. It has 2 divisors and a digital root of 7.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value149,767
Digit count6
Digit sum34
Digit product10,584
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root7repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 149,767
Distinct prime factors1149,767
Number of divisors2
Sum of divisors σ(n)149,768
SquarefreeYesno repeated prime factor
All divisors1, 149,7672 in total
Arithmetic
Representations
Decimal-149,767
Binary10010010010000011118 bits
Octal444407
Hexadecimal24907
Base 3637K7
In wordsminus one hundred and forty-nine thousand, seven hundred and sixty-seven
Ordinalminus one hundred and forty-nine thousand, seven hundred and sixty-seventh
Scientific notation-1.49767 × 10^5
Engineering notation-149.767 × 10^3
In other bases
Ternary21121102221base 3; the most digit-efficient integer base after e: 11 digits
Quinary14243032base 5; one hand: 8 digits
Septenary1162432base 7: 7 digits
Nonary247387base 9; each digit is two ternary digits: 6 digits
Duodecimal72807base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalie87base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:36:7base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0111TTT001Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100101100001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011011011111001
Bit length18 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits11within that length
Bit parityodd7 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 49 07
Gray code110110110110000100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011011011111001two's complement
64-bit1111111111111111111111111111111111111111111111011011011011111001two's complement
One's complement00000000000000100100100100000110at 32 bits, every bit flipped
Bits reversed10011111011011011011111111111111at 32 bits
Rotated left by 111111111111110110110110111110011at 32 bits, wrapping
Shifted left by 1-1001001001000001110= -299,534, no wrap
Shifted right by 1-10010010010000100= -74,883, discarding the low bit
These bits as a double7.39947296 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-149,767 to the power 222,430,154,289
-149,767 to the power 3-3,359,296,917,400,663
-149,767 to the power 4503,111,821,428,345,095,521
-149,767 to the power 5-75,349,548,159,858,959,920,893,607
First ten multiples-149,767, -299,534, -449,301, -599,068, -748,835, -898,602, -1,048,369, -1,198,136, -1,347,903, -1,497,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 2
Divisible by 8No, remainder 7
Divisible by 9No, remainder 7
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 7
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-14,976,700%
-149,767% as a decimal-1,497.67
-149,767% of 100-149,767
-149,767% of 1,000-1,497,670
As a fraction of 100-149,767/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -149,767
Nerdulate something else
Nothing in mind? Surprise me · today’s page