Recognised as Number
-270,380
- Negative
- Even
- 6 digits
-270,380 is an even 6-digit integer and the negative of 270,380. It has 24 divisors and a digital root of 2.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value270,380
Digit count6
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2^2 × 5 × 11 × 1,229
Distinct prime factors42, 5, 11, 1,229
Number of divisors24
Sum of divisors σ(n)619,920
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 11, 20, 22, 44, 55, 110, 220, 1,229, 2,458, 4,916, 6,145, 12,290, 13,519, 24,580, 27,038, 54,076, 67,595, 135,190, 270,38024 in total
Arithmetic
Representations
Decimal-270,380
Binary100001000000010110019 bits
Octal1020054
Hexadecimal4202C
Base 365SMK
In wordsminus two hundred and seventy thousand, three hundred and eighty
Ordinalminus two hundred and seventy thousand, three hundred and eightieth
Scientific notation-2.7038 × 10^5
Engineering notation-270.38 × 10^3
In other bases
Ternary111201220002base 3; the most digit-efficient integer base after e: 12 digits
Quinary32123010base 5; one hand: 8 digits
Septenary2204165base 7: 7 digits
Nonary451802base 9; each digit is two ternary digits: 6 digits
Duodecimal110578base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal1dfj0base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:15:6:20base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1111T10100T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000010000011010100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110111101111111010100
Bit length19 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits14within that length
Bit parityodd5 set bits, so odd; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes304 20 2c
Gray code1100011000000111010n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110111101111111010100two's complement
64-bit1111111111111111111111111111111111111111111110111101111111010100two's complement
One's complement00000000000001000010000000101011at 32 bits, every bit flipped
Bits reversed00101011111110111101111111111111at 32 bits
Rotated left by 111111111111101111011111110101001at 32 bits, wrapping
Shifted left by 1-10000100000001011000= -540,760, no wrap
Shifted right by 1-100001000000010110= -135,190, discarding the low bit
These bits as a double1.33585469 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-270,380 to the power 273,105,344,400
-270,380 to the power 3-19,766,223,018,872,000
-270,380 to the power 45,344,391,379,842,611,360,000
-270,380 to the power 5-1,445,016,541,281,845,259,516,800,000
First ten multiples-270,380, -540,760, -811,140, -1,081,520, -1,351,900, -1,622,280, -1,892,660, -2,163,040, -2,433,420, -2,703,800
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 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8No, remainder 4
Divisible by 9No, remainder 2
Divisible by 10Yes
Divisible by 11Yes
Divisible by 12No, remainder 8
Divisible by 100No, remainder 80
As a percentage & fraction
As a percentage-27,038,000%
-270,380% as a decimal-2,703.8
-270,380% of 100-270,380
-270,380% of 1,000-2,703,800
As a fraction of 100-270,380/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -270,380
Nerdulate something else
Nothing in mind? Surprise me · today’s page