Recognised as Number
-355,892
- Negative
- Even
- 6 digits
-355,892 is an even 6-digit integer and the negative of 355,892. It has 12 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value355,892
Digit count6
Digit sum32
Digit product10,800
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 × 2^2 × 193 × 461
Distinct prime factors32, 193, 461
Number of divisors12
Sum of divisors σ(n)627,396
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 193, 386, 461, 772, 922, 1,844, 88,973, 177,946, 355,89212 in total
Arithmetic
Representations
Decimal-355,892
Binary101011011100011010019 bits
Octal1267064
Hexadecimal56E34
Base 367MLW
In wordsminus three hundred and fifty-five thousand, eight hundred and ninety-two
Ordinalminus three hundred and fifty-five thousand, eight hundred and ninety-second
Scientific notation-3.55892 × 10^5
Engineering notation-355.892 × 10^3
In other bases
Ternary200002012012base 3; the most digit-efficient integer base after e: 12 digits
Quinary42342032base 5; one hand: 8 digits
Septenary3011405base 7: 7 digits
Nonary602165base 9; each digit is two ternary digits: 6 digits
Duodecimal151b58base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal249ecbase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:38:51:32base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1000T1T11T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11111001011011011100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110101001000111001100
Bit length19 bitsto write the magnitude
Set bits10the population count, or Hamming weight
Zero bits9within that length
Bit parityeven10 set bits, so even; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes305 6e 34
Gray code1111101100100101110n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110101001000111001100two's complement
64-bit1111111111111111111111111111111111111111111110101001000111001100two's complement
One's complement00000000000001010110111000110011at 32 bits, every bit flipped
Bits reversed00110011100010010101111111111111at 32 bits
Rotated left by 111111111111101010010001110011001at 32 bits, wrapping
Shifted left by 1-10101101110001101000= -711,784, no wrap
Shifted right by 1-101011011100011010= -177,946, discarding the low bit
These bits as a double1.75834011 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-355,892 to the power 2126,659,115,664
-355,892 to the power 3-45,076,965,991,892,288
-355,892 to the power 416,042,531,580,786,530,160,896
-355,892 to the power 5-5,709,408,649,349,279,792,021,599,232
First ten multiples-355,892, -711,784, -1,067,676, -1,423,568, -1,779,460, -2,135,352, -2,491,244, -2,847,136, -3,203,028, -3,558,920
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 5
Divisible by 10No, remainder 2
Divisible by 11No, remainder 9
Divisible by 12No, remainder 8
Divisible by 100No, remainder 92
As a percentage & fraction
As a percentage-35,589,200%
-355,892% as a decimal-3,558.92
-355,892% of 100-355,892
-355,892% of 1,000-3,558,920
As a fraction of 100-355,892/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -355,892
Nerdulate something else
Nothing in mind? Surprise me · today’s page