Nerdulator> put something in

Recognised as Number

-447

  • Negative
  • Odd
  • 3 digits

-447 is an odd 3-digit integer and the negative of 447. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value447
Digit count3
Digit sum15
Digit product112
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 3 × 149
Distinct prime factors23, 149
Number of divisors4
Sum of divisors σ(n)600
SquarefreeYesno repeated prime factor
All divisors1, 3, 149, 4474 in total

Arithmetic

Previous number-448
Next number-446
Double-894
Half-223.5
Square199,809
Cube root-7.646027242
Negation447
Reciprocal-0.0022371365

Representations

Decimal-447
Binary1101111119 bits
Octal677
Hexadecimal1BF
Base 36CF
In wordsminus four hundred and forty-seven
Ordinalminus four hundred and forty-seventh
Scientific notation-4.47 × 10^2
Engineering notation-447

In other bases

Ternary121120base 3; the most digit-efficient integer base after e: 6 digits
Quinary3242base 5; one hand: 4 digits
Septenary1206base 7: 4 digits
Nonary546base 9; each digit is two ternary digits: 3 digits
Duodecimal313base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 3 digits
Vigesimal127base 20; hands and feet, and the Mayan and Yoruba systems: 3 digits
Sexagesimal7:27base 60; Babylonian, and still how an hour and a circle are divided: 2 digits
Balanced ternaryT101110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1001000001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111001000001
Bit length9 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits1within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 8worth 256
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes201 bf
Gray code101100000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1111111001000001two's complement
32-bit11111111111111111111111001000001two's complement
64-bit1111111111111111111111111111111111111111111111111111111001000001two's complement
One's complement0000000110111110at 16 bits, every bit flipped
Bits reversed1000001001111111at 16 bits
Rotated left by 11111110010000011at 16 bits, wrapping
Shifted left by 1-1101111110= -894, no wrap
Shifted right by 1-11100000= -223, discarding the low bit
These bits as a double2.20847344 × 10^-321IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+449
Nearest square below441
Nearest square above484

Powers & multiples

-447 to the power 2199,809
-447 to the power 3-89,314,623
-447 to the power 439,923,636,481
-447 to the power 5-17,845,865,507,007
First ten multiples-447, -894, -1,341, -1,788, -2,235, -2,682, -3,129, -3,576, -4,023, -4,470
Powers of twoBetween 2^8 (256) and 2^9 (512)

Divisibility tests

Divisible by 2No, remainder 1
Divisible by 3Yes
Divisible by 4No, remainder 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 3
Divisible by 7No, remainder 6
Divisible by 8No, remainder 7
Divisible by 9No, remainder 6
Divisible by 10No, remainder 7
Divisible by 11No, remainder 7
Divisible by 12No, remainder 3
Divisible by 100No, remainder 47

As a percentage & fraction

As a percentage-44,700%
-447% as a decimal-4.47
-447% of 100-447
-447% of 1,000-4,470
As a fraction of 100-447/100

Keep nerding

Every link below is a page Nerdulator can generate from what it already knows about this value.

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “-447” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.