Recognised as Number
-133,151
- Negative
- Odd
- 6 digits
-133,151 is an odd 6-digit integer and the negative of 133,151. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value133,151
Digit count6
Digit sum14
Digit product45
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 47 × 2,833
Distinct prime factors247, 2,833
Number of divisors4
Sum of divisors σ(n)136,032
SquarefreeYesno repeated prime factor
All divisors1, 47, 2,833, 133,1514 in total
Arithmetic
Representations
Decimal-133,151
Binary10000010000001111118 bits
Octal404037
Hexadecimal2081F
Base 362UQN
In wordsminus one hundred and thirty-three thousand, one hundred and fifty-one
Ordinalminus one hundred and thirty-three thousand, one hundred and fifty-first
Scientific notation-1.33151 × 10^5
Engineering notation-133.151 × 10^3
In other bases
Ternary20202122112base 3; the most digit-efficient integer base after e: 11 digits
Quinary13230101base 5; one hand: 8 digits
Septenary1063124base 7: 7 digits
Nonary222575base 9; each digit is two ternary digits: 6 digits
Duodecimal6507bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalgchbbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal36:59:11base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT1T1T0100111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary100000100000100001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011111011111100001
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 08 1f
Gray code110000110000010000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011111011111100001two's complement
64-bit1111111111111111111111111111111111111111111111011111011111100001two's complement
One's complement00000000000000100000100000011110at 32 bits, every bit flipped
Bits reversed10000111111011111011111111111111at 32 bits
Rotated left by 111111111111110111110111111000011at 32 bits, wrapping
Shifted left by 1-1000001000000111110= -266,302, no wrap
Shifted right by 1-10000010000010000= -66,575, discarding the low bit
These bits as a double6.57853348 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-133,151 to the power 217,729,188,801
-133,151 to the power 3-2,360,659,218,041,951
-133,151 to the power 4314,324,135,541,503,817,601
-133,151 to the power 5-41,852,572,971,486,774,817,390,751
First ten multiples-133,151, -266,302, -399,453, -532,604, -665,755, -798,906, -932,057, -1,065,208, -1,198,359, -1,331,510
Powers of twoBetween 2^17 (131,072) and 2^18 (262,144)
Divisibility tests
Divisible by 2No, remainder 1
Divisible by 3No, remainder 2
Divisible by 4No, remainder 3
Divisible by 5No, remainder 1
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 7
Divisible by 9No, remainder 5
Divisible by 10No, remainder 1
Divisible by 11No, remainder 7
Divisible by 12No, remainder 11
Divisible by 100No, remainder 51
As a percentage & fraction
As a percentage-13,315,100%
-133,151% as a decimal-1,331.51
-133,151% of 100-133,151
-133,151% of 1,000-1,331,510
As a fraction of 100-133,151/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -133,151
Nerdulate something else
Nothing in mind? Surprise me · today’s page