Recognised as Number
-470,970
- Negative
- Even
- 6 digits
-470,970 is an even 6-digit integer and the negative of 470,970. It has 24 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value470,970
Digit count6
Digit sum27
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 3^2 × 5 × 5,233
Distinct prime factors42, 3, 5, 5,233
Number of divisors24
Sum of divisors σ(n)1,224,756
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 30, 45, 90, 5,233, 10,466, 15,699, 26,165, 31,398, 47,097, 52,330, 78,495, 94,194, 156,990, 235,485, 470,97024 in total
Arithmetic
Representations
Decimal-470,970
Binary111001011111011101019 bits
Octal1627672
Hexadecimal72FBA
Base 36A3EI
In wordsminus four hundred and seventy thousand, nine hundred and seventy
Ordinalminus four hundred and seventy thousand, nine hundred and seventieth
Scientific notation-4.7097 × 10^5
Engineering notation-470.97 × 10^3
In other bases
Ternary212221001100base 3; the most digit-efficient integer base after e: 12 digits
Quinary110032340base 5; one hand: 9 digits
Septenary4001043base 7: 7 digits
Nonary787040base 9; each digit is two ternary digits: 6 digits
Duodecimal1a8676base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal2ih8abase 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:10:49:30base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT01001T00TT00digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011101000001011010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11111111111110001101000001000110
Bit length19 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits6within that length
Bit parityodd13 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
Bytes307 2f ba
Gray code1001011100001100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11111111111110001101000001000110two's complement
64-bit1111111111111111111111111111111111111111111110001101000001000110two's complement
One's complement00000000000001110010111110111001at 32 bits, every bit flipped
Bits reversed01100010000010110001111111111111at 32 bits
Rotated left by 111111111111100011010000010001101at 32 bits, wrapping
Shifted left by 1-11100101111101110100= -941,940, no wrap
Shifted right by 1-111001011111011101= -235,485, discarding the low bit
These bits as a double2.32690097 × 10^-318≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Powers & multiples
-470,970 to the power 2221,812,740,900
-470,970 to the power 3-104,467,146,581,673,000
-470,970 to the power 449,200,892,025,570,532,810,000
-470,970 to the power 5-23,172,144,117,282,953,837,525,700,000
First ten multiples-470,970, -941,940, -1,412,910, -1,883,880, -2,354,850, -2,825,820, -3,296,790, -3,767,760, -4,238,730, -4,709,700
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 3
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 5
Divisible by 12No, remainder 6
Divisible by 100No, remainder 70
As a percentage & fraction
As a percentage-47,097,000%
-470,970% as a decimal-4,709.7
-470,970% of 100-470,970
-470,970% of 1,000-4,709,700
As a fraction of 100-470,970/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from -470,970
Nerdulate something else
Nothing in mind? Surprise me · today’s page