Recognised as Number
-155,137
- Negative
- Odd
- 6 digits
-155,137 is an odd 6-digit integer and the negative of 155,137. It has 2 divisors and a digital root of 4.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value155,137
Digit count6
Digit sum22
Digit product525
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 155,137
Distinct prime factors1155,137
Number of divisors2
Sum of divisors σ(n)155,138
SquarefreeYesno repeated prime factor
All divisors1, 155,1372 in total
Arithmetic
Representations
Decimal-155,137
Binary10010111100000000118 bits
Octal457001
Hexadecimal25E01
Base 363BPD
In wordsminus one hundred and fifty-five thousand, one hundred and thirty-seven
Ordinalminus one hundred and fifty-five thousand, one hundred and thirty-seventh
Scientific notation-1.55137 × 10^5
Engineering notation-155.137 × 10^3
In other bases
Ternary21212210211base 3; the most digit-efficient integer base after e: 11 digits
Quinary14431022base 5; one hand: 8 digits
Septenary1214203base 7: 7 digits
Nonary255724base 9; each digit is two ternary digits: 6 digits
Duodecimal75941base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalj7ghbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal43:5:37base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT010101TT1TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110011000000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011010000111111111
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 5e 01
Gray code110111000100000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011010000111111111two's complement
64-bit1111111111111111111111111111111111111111111111011010000111111111two's complement
One's complement00000000000000100101111000000000at 32 bits, every bit flipped
Bits reversed11111111100001011011111111111111at 32 bits
Rotated left by 111111111111110110100001111111111at 32 bits, wrapping
Shifted left by 1-1001011110000000010= -310,274, no wrap
Shifted right by 1-10010111100000001= -77,568, discarding the low bit
These bits as a double7.66478621 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-155,137 to the power 224,067,488,769
-155,137 to the power 3-3,733,758,005,156,353
-155,137 to the power 4579,244,015,645,941,135,361
-155,137 to the power 5-89,862,178,855,264,369,916,499,457
First ten multiples-155,137, -310,274, -465,411, -620,548, -775,685, -930,822, -1,085,959, -1,241,096, -1,396,233, -1,551,370
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 1
Divisible by 5No, remainder 2
Divisible by 6No, remainder 1
Divisible by 7No, remainder 3
Divisible by 8No, remainder 1
Divisible by 9No, remainder 4
Divisible by 10No, remainder 7
Divisible by 11No, remainder 4
Divisible by 12No, remainder 1
Divisible by 100No, remainder 37
As a percentage & fraction
As a percentage-15,513,700%
-155,137% as a decimal-1,551.37
-155,137% of 100-155,137
-155,137% of 1,000-1,551,370
As a fraction of 100-155,137/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -155,137
Nerdulate something else
Nothing in mind? Surprise me · today’s page