Nerdulator> put something in

Recognised as Number

-504,001

  • Negative
  • Odd
  • 6 digits

-504,001 is an odd 6-digit integer and the negative of 504,001. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value504,001
Digit count6
Digit sum10
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 504,001
Distinct prime factors1504,001
Number of divisors2
Sum of divisors σ(n)504,002
SquarefreeYesno repeated prime factor
All divisors1, 504,0012 in total

Arithmetic

Previous number-504,002
Next number-504,000
Cube-128,024,826,049,512,001
Cube root-79.581196791
Negation504,001
Reciprocal-0.0000019841

Representations

Decimal-504,001
Binary111101100001100000119 bits
Octal1730301
Hexadecimal7B0C1
Base 36ASW1
In wordsminus five hundred and four thousand and one
Ordinalminus five hundred and four thousand and first
Scientific notation-5.04001 × 10^5
Engineering notation-504.001 × 10^3

In other bases

Ternary221121100201base 3; the most digit-efficient integer base after e: 12 digits
Quinary112112001base 5; one hand: 9 digits
Septenary4166251base 7: 7 digits
Nonary847321base 9; each digit is two ternary digits: 6 digits
Duodecimal203801base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 6 digits
Vigesimal33001base 20; hands and feet, and the Mayan and Yoruba systems: 5 digits
Sexagesimal2:20:0:1base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT00111TT0T10Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000101001101000011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111111110000100111100111111
Bit length19 bitsto write the magnitude
Set bits9the population count, or Hamming weight
Zero bits10within that length
Bit parityodd9 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 18worth 262,144
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes307 b0 c1
Gray code1000110100010100001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111111110000100111100111111two's complement
64-bit1111111111111111111111111111111111111111111110000100111100111111two's complement
One's complement00000000000001111011000011000000at 32 bits, every bit flipped
Bits reversed11111100111100100001111111111111at 32 bits
Rotated left by 111111111111100001001111001111111at 32 bits, wrapping
Shifted left by 1-11110110000110000010= -1,008,002, no wrap
Shifted right by 1-111101100001100001= -252,000, discarding the low bit
These bits as a double2.4900958 × 10^-318IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+504,003
Nearest square below502,681
Nearest square above504,100

Powers & multiples

-504,001 to the power 2254,017,008,001
-504,001 to the power 3-128,024,826,049,512,001
-504,001 to the power 464,524,640,353,780,098,016,001
-504,001 to the power 5-32,520,483,262,945,523,180,162,520,001
First ten multiples-504,001, -1,008,002, -1,512,003, -2,016,004, -2,520,005, -3,024,006, -3,528,007, -4,032,008, -4,536,009, -5,040,010
Powers of twoBetween 2^18 (262,144) and 2^19 (524,288)

Divisibility tests

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

As a percentage & fraction

As a percentage-50,400,100%
-504,001% as a decimal-5,040.01
-504,001% of 100-504,001
-504,001% of 1,000-5,040,010
As a fraction of 100-504,001/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 “-504001” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.