Recognised as Number
-427,270
- Negative
- Even
- 6 digits
-427,270 is an even 6-digit integer and the negative of 427,270. It has 8 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value427,270
Digit count6
Digit sum22
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 5 × 42,727
Distinct prime factors32, 5, 42,727
Number of divisors8
Sum of divisors σ(n)769,104
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 42,727, 85,454, 213,635, 427,2708 in total
Arithmetic
Representations
Decimal-427,270
Binary110100001010000011019 bits
Octal1502406
Hexadecimal68506
Base 3695OM
In wordsminus four hundred and twenty-seven thousand, two hundred and seventy
Ordinalminus four hundred and twenty-seven thousand, two hundred and seventieth
Scientific notation-4.2727 × 10^5
Engineering notation-427.27 × 10^3
In other bases
Ternary210201002211base 3; the most digit-efficient integer base after e: 12 digits
Quinary102133040base 5; one hand: 9 digits
Septenary3426454base 7: 7 digits
Nonary721084base 9; each digit is two ternary digits: 6 digits
Duodecimal18731abase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2d83abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal1:58:41:10base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1TT10T0T01TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101000111100001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110010111101011111010
Bit length19 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits12within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 18worth 262,144
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes306 85 06
Gray code1011100011110000101n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110010111101011111010two's complement
64-bit1111111111111111111111111111111111111111111110010111101011111010two's complement
One's complement00000000000001101000010100000101at 32 bits, every bit flipped
Bits reversed01011111010111101001111111111111at 32 bits
Rotated left by 111111111111100101111010111110101at 32 bits, wrapping
Shifted left by 1-11010000101000001100= -854,540, no wrap
Shifted right by 1-110100001010000011= -213,635, discarding the low bit
These bits as a double2.11099428 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-427,270 to the power 2182,559,652,900
-427,270 to the power 3-78,002,262,894,583,000
-427,270 to the power 433,328,026,866,968,478,410,000
-427,270 to the power 5-14,240,066,039,449,621,770,240,700,000
First ten multiples-427,270, -854,540, -1,281,810, -1,709,080, -2,136,350, -2,563,620, -2,990,890, -3,418,160, -3,845,430, -4,272,700
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 8
Divisible by 12No, remainder 10
Divisible by 100No, remainder 70
As a percentage & fraction
As a percentage-42,727,000%
-427,270% as a decimal-4,272.7
-427,270% of 100-427,270
-427,270% of 1,000-4,272,700
As a fraction of 100-427,270/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -427,270
Nerdulate something else
Nothing in mind? Surprise me · today’s page