Recognised as Number
-149,367
- Negative
- Odd
- 6 digits
-149,367 is an odd 6-digit integer and the negative of 149,367. It has 4 divisors and a digital root of 3.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value149,367
Digit count6
Digit sum30
Digit product4,536
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 3 × 49,789
Distinct prime factors23, 49,789
Number of divisors4
Sum of divisors σ(n)199,160
SquarefreeYesno repeated prime factor
All divisors1, 3, 49,789, 149,3674 in total
Arithmetic
Representations
Decimal-149,367
Binary10010001110111011118 bits
Octal443567
Hexadecimal24777
Base 363793
In wordsminus one hundred and forty-nine thousand, three hundred and sixty-seven
Ordinalminus one hundred and forty-nine thousand, three hundred and sixty-seventh
Scientific notation-1.49367 × 10^5
Engineering notation-149.367 × 10^3
In other bases
Ternary21120220010base 3; the most digit-efficient integer base after e: 11 digits
Quinary14234432base 5; one hand: 8 digits
Septenary1161321base 7: 7 digits
Nonary246803base 9; each digit is two ternary digits: 6 digits
Duodecimal72533base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalid87base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal41:29:27base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT0111T0100T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101100100110011001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011011100010001001
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 47 77
Gray code110110010011001100n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011011100010001001two's complement
64-bit1111111111111111111111111111111111111111111111011011100010001001two's complement
One's complement00000000000000100100011101110110at 32 bits, every bit flipped
Bits reversed10010001000111011011111111111111at 32 bits
Rotated left by 111111111111110110111000100010011at 32 bits, wrapping
Shifted left by 1-1001000111011101110= -298,734, no wrap
Shifted right by 1-10010001110111100= -74,683, discarding the low bit
These bits as a double7.37971033 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-149,367 to the power 222,310,500,689
-149,367 to the power 3-3,332,452,556,413,863
-149,367 to the power 4497,758,440,993,869,474,721
-149,367 to the power 5-74,348,685,055,931,301,830,651,607
First ten multiples-149,367, -298,734, -448,101, -597,468, -746,835, -896,202, -1,045,569, -1,194,936, -1,344,303, -1,493,670
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 1
Divisible by 8No, remainder 7
Divisible by 9No, remainder 3
Divisible by 10No, remainder 7
Divisible by 11No, remainder 9
Divisible by 12No, remainder 3
Divisible by 100No, remainder 67
As a percentage & fraction
As a percentage-14,936,700%
-149,367% as a decimal-1,493.67
-149,367% of 100-149,367
-149,367% of 1,000-1,493,670
As a fraction of 100-149,367/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -149,367
Nerdulate something else
Nothing in mind? Surprise me · today’s page