Recognised as Number
-155,165
- Negative
- Odd
- 6 digits
-155,165 is an odd 6-digit integer and the negative of 155,165. It has 4 divisors and a digital root of 5.
Number properties
ParityOddnot divisible by 2
SignNegative
Absolute value155,165
Digit count6
Digit sum23
Digit product750
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 5 × 31,033
Distinct prime factors25, 31,033
Number of divisors4
Sum of divisors σ(n)186,204
SquarefreeYesno repeated prime factor
All divisors1, 5, 31,033, 155,1654 in total
Arithmetic
Representations
Decimal-155,165
Binary10010111100001110118 bits
Octal457035
Hexadecimal25E1D
Base 363BQ5
In wordsminus one hundred and fifty-five thousand, one hundred and sixty-five
Ordinalminus one hundred and fifty-five thousand, one hundred and sixty-fifth
Scientific notation-1.55165 × 10^5
Engineering notation-155.165 × 10^3
In other bases
Ternary21212211212base 3; the most digit-efficient integer base after e: 11 digits
Quinary14431130base 5; one hand: 8 digits
Septenary1214243base 7: 7 digits
Nonary255755base 9; each digit is two ternary digits: 6 digits
Duodecimal75965base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimalj7i5base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal43:6:5base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternaryT01010011011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110011000100111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111111011010000111100011
Bit length18 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits8within that length
Bit parityeven10 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 5e 1d
Gray code110111000100010011n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111111011010000111100011two's complement
64-bit1111111111111111111111111111111111111111111111011010000111100011two's complement
One's complement00000000000000100101111000011100at 32 bits, every bit flipped
Bits reversed11000111100001011011111111111111at 32 bits
Rotated left by 111111111111110110100001111000111at 32 bits, wrapping
Shifted left by 1-1001011110000111010= -310,330, no wrap
Shifted right by 1-10010111100001111= -77,582, discarding the low bit
These bits as a double7.66616959 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-155,165 to the power 224,076,177,225
-155,165 to the power 3-3,735,780,039,117,125
-155,165 to the power 4579,662,309,769,608,700,625
-155,165 to the power 5-89,943,302,295,401,334,032,478,125
First ten multiples-155,165, -310,330, -465,495, -620,660, -775,825, -930,990, -1,086,155, -1,241,320, -1,396,485, -1,551,650
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 1
Divisible by 5Yes
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 5
Divisible by 9No, remainder 5
Divisible by 10No, remainder 5
Divisible by 11No, remainder 10
Divisible by 12No, remainder 5
Divisible by 100No, remainder 65
As a percentage & fraction
As a percentage-15,516,500%
-155,165% as a decimal-1,551.65
-155,165% of 100-155,165
-155,165% of 1,000-1,551,650
As a fraction of 100-155,165/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -155,165
Nerdulate something else
Nothing in mind? Surprise me · today’s page