Nerdulator> put something in

Recognised as Number

-2,181,825,073

  • Negative
  • Odd
  • Perfect cube
  • 10 digits

-2,181,825,073 is an odd 10-digit integer and the negative of 2,181,825,073. It has 4 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value2,181,825,073
Digit count10
Digit sum37
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
Perfect cubeYes, -1,297³

Factors & divisors

Prime factorisation−1 × 1,297^3
Distinct prime factors11,297
Number of divisors4
Sum of divisors σ(n)2,183,508,580
SquarefreeNohas a repeated prime factor
All divisors1, 1,297, 1,682,209, 2,181,825,0734 in total

Arithmetic

Previous number-2,181,825,074
Next number-2,181,825,072
Square4,760,360,649,171,455,329
Cube-10,386,274,220,884,837,912,711,664,017
Cube root-1,297
Reciprocal-4.58331886 × 10^-10

Representations

Decimal-2,181,825,073
Binary1000001000001100000000100011000132 bits
Octal20203001061
Hexadecimal820C0231
Base 361030301
In wordsminus two billion, one hundred and eighty-one million, eight hundred and twenty-five thousand and seventy-three
Ordinalminus two billion, one hundred and eighty-one million, eight hundred and twenty-five thousand and seventy-third
Scientific notation-2.18182507 × 10^9
Engineering notation-2.181825 × 10^9

In other bases

Ternary12122001111012100001base 3; the most digit-efficient integer base after e: 20 digits
Quinary13432021400243base 5; one hand: 14 digits
Septenary105032131021base 7: 12 digits
Nonary5561435301base 9; each digit is two ternary digits: 10 digits
Duodecimal50a832301base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimal1e1g82ddbase 20; hands and feet, and the Mayan and Yoruba systems: 8 digits
Sexagesimal2:48:21:2:31:13base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT1010100TTTTT11T0000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010001101000000001011010011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111111111111111111111111111101111101111100111111110111001111
Bit length32 bitsto write the magnitude
Set bits8the population count, or Hamming weight
Zero bits24within that length
Bit parityeven8 set bits, so even; not the same as the number itself being odd
Highest set bitbit 31worth 2,147,483,648
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes482 0c 02 31
Gray code11000011000010100000001100101001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111111111111111111111111111111101111101111100111111110111001111two's complement
One's complement0000000000000000000000000000000010000010000011000000001000110000at 64 bits, every bit flipped
Bits reversed1111001110111111110011111011111011111111111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111111111111011111011111001111111101110011111at 64 bits, wrapping
Shifted left by 1-100000100000110000000010001100010= -4,363,650,146, no wrap
Shifted right by 1-1000001000001100000000100011001= -1,090,912,536, discarding the low bit
These bits as a double1.07796481 × 10^-314IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+2,181,825,075
Nearest square below2,181,824,100
Nearest square above2,181,917,521

Powers & multiples

-2,181,825,073 to the power 24,760,360,649,171,455,329
-2,181,825,073 to the power 3-10,386,274,220,884,837,912,711,664,017
-2,181,825,073 to the power 422,661,033,510,180,079,603,495,293,971,842,498,241
-2,181,825,073 to the power 5-49442411092604098424041930825… (48 digits)
First ten multiples-2,181,825,073, -4,363,650,146, -6,545,475,219, -8,727,300,292, -10,909,125,365, -13,090,950,438, -15,272,775,511, -17,454,600,584, -19,636,425,657, -21,818,250,730
Powers of twoBetween 2^31 (2,147,483,648) and 2^32 (4,294,967,296)

Divisibility tests

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

As a percentage & fraction

As a percentage-218,182,507,300%
-2,181,825,073% as a decimal-21,818,250.73
-2,181,825,073% of 100-2,181,825,073
-2,181,825,073% of 1,000-21,818,250,730
As a fraction of 100-2,181,825,073/100

Keep nerding

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

Also reads as

2181825073 (identifier)

  • 10 characters
  • Checksum fails

2181825073 matches the shape of ISBN-10, Luhn (cards, IMEI). No check digit validates. A valid check digit only means the number is well-formed; it cannot tell you the thing it identifies exists.

Open this reading on its own page →

Checksum tests

ISBN-10Check digit does not matchmod 11 with weights 10 down to 1
Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled

What this does not tell you

ExistenceNot checkedno network lookup is made, ever
Ownership or validity in useNot checked

Nerdulate something else

Nothing in mind? Surprise me · today’s page

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