Recognised as Number
-149,769
- Negative
- Odd
- Perfect square
- 6 digits
-149,769 is an odd 6-digit integer and the negative of 149,769. It has 15 divisors and a digital root of 9.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value149,769
Digit count6
Digit sum36
Digit product13,608
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Perfect squareYes, 387²
Factors & divisors
Prime factorisation−1 × 3^4 × 43^2
Distinct prime factors23, 43
Number of divisors15
Sum of divisors σ(n)229,053
SquarefreeNohas a repeated prime factor
All divisors1, 3, 9, 27, 43, 81, 129, 387, 1,161, 1,849, 3,483, 5,547, 16,641, 49,923, 149,76915 in total
Arithmetic
Representations
Decimal-149,769
Binary10010010010000100118 bits
Octal444411
Hexadecimal24909
Base 3637K9
In wordsminus one hundred and forty-nine thousand, seven hundred and sixty-nine
Ordinalminus one hundred and forty-nine thousand, seven hundred and sixty-ninth
Scientific notation-1.49769 × 10^5
Engineering notation-149.769 × 10^3
In other bases
Ternary21121110000base 3; the most digit-efficient integer base after e: 11 digits
Quinary14243034base 5; one hand: 8 digits
Septenary1162434base 7: 7 digits
Nonary247400base 9; each digit is two ternary digits: 6 digits
Duodecimal72809base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalie89base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:36:9base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0111TTT0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100101100001011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011011011110111
Bit length18 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits12within that length
Bit parityeven6 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 49 09
Gray code110110110110001101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011011011110111two's complement
64-bit1111111111111111111111111111111111111111111111011011011011110111two's complement
One's complement00000000000000100100100100001000at 32 bits, every bit flipped
Bits reversed11101111011011011011111111111111at 32 bits
Rotated left by 111111111111110110110110111101111at 32 bits, wrapping
Shifted left by 1-1001001001000010010= -299,538, no wrap
Shifted right by 1-10010010010000101= -74,884, discarding the low bit
These bits as a double7.39957177 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-149,769 to the power 222,430,753,361
-149,769 to the power 3-3,359,431,500,123,609
-149,769 to the power 4503,138,696,342,012,796,321
-149,769 to the power 5-75,354,579,412,446,914,492,199,849
First ten multiples-149,769, -299,538, -449,307, -599,076, -748,845, -898,614, -1,048,383, -1,198,152, -1,347,921, -1,497,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 4
Divisible by 8No, remainder 1
Divisible by 9Yes
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 9
Divisible by 100No, remainder 69
As a percentage & fraction
As a percentage-14,976,900%
-149,769% as a decimal-1,497.69
-149,769% of 100-149,769
-149,769% of 1,000-1,497,690
As a fraction of 100-149,769/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -149,769
Nerdulate something else
Nothing in mind? Surprise me · today’s page