Recognised as Number
-1,073,741,822
- Negative
- Even
- 10 digits
-1,073,741,822 is an even 10-digit integer and the negative of 1,073,741,822. It has 16 divisors and a digital root of 8.
Number properties
ParityEvendivisible by 2
SignNegative
Absolute value1,073,741,822
Digit count10
Digit sum35
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards
Factors & divisors
Prime factorisation−1 × 2 × 233 × 1,103 × 2,089
Distinct prime factors42, 233, 1,103, 2,089
Number of divisors16
Sum of divisors σ(n)1,619,766,720
SquarefreeYesno repeated prime factor
All divisors1, 2, 233, 466, 1,103, 2,089, 2,206, 4,178, 256,999, 486,737, 513,998, 973,474, 2,304,167, 4,608,334, 536,870,911, 1,073,741,82216 in total
Arithmetic
Previous number-1,073,741,823
Next number-1,073,741,821
Double-2,147,483,644
Half-536,870,911
Square1,152,921,500,311,879,684
Cube-1,237,940,032,367,851,260,142,944,248
Cube root-1,023.999999364≈
Negation1,073,741,822
Reciprocal-9.31322576 × 10^-10≈
Representations
Decimal-1,073,741,822
Binary11111111111111111111111111111030 bits
Octal7777777776
Hexadecimal3FFFFFFE
Base 36HRA0HQ
In wordsminus one billion, seventy-three million, seven hundred and forty-one thousand, eight hundred and twenty-two
Ordinalminus one billion, seventy-three million, seven hundred and forty-one thousand, eight hundred and twenty-second
Scientific notation-1.07374182 × 10^9
Engineering notation-1.073742 × 10^9
In other bases
Ternary2202211102201212122base 3; the most digit-efficient integer base after e: 19 digits
Quinary4144334214242base 5; one hand: 13 digits
Septenary35415440426base 7: 11 digits
Nonary2684381778base 9; each digit is two ternary digits: 10 digits
Duodecimal25b716452base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 9 digits
Vigesimalgfaheb2base 20; hands and feet, and the Mayan and Yoruba systems: 7 digits
Sexagesimal1:22:51:1:37:2base 60; Babylonian, and still how an hour and a circle are divided: 6 digits
Balanced ternaryT01T01TTTT01T1010101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000000000000000000000000000110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
11000000000000000000000000000010
Bit length30 bitsto write the magnitude
Set bits29the population count, or Hamming weight
Zero bits1within that length
Bit parityodd29 set bits, so odd; not the same as the number itself being even
Highest set bitbit 29worth 536,870,912
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes43f ff ff fe
Gray code100000000000000000000000000001n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit11000000000000000000000000000010two's complement
64-bit1111111111111111111111111111111111000000000000000000000000000010two's complement
One's complement00111111111111111111111111111101at 32 bits, every bit flipped
Bits reversed01000000000000000000000000000011at 32 bits
Rotated left by 110000000000000000000000000000101at 32 bits, wrapping
Shifted left by 1-1111111111111111111111111111100= -2,147,483,644, no wrap
Shifted right by 1-11111111111111111111111111111= -536,870,911, discarding the low bit
These bits as a double5.30498947 × 10^-315≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
-1,073,741,822 to the power 21,152,921,500,311,879,684
-1,073,741,822 to the power 3-1,237,940,032,367,851,260,142,944,248
-1,073,741,822 to the power 41,329,227,985,881,395,586,290,880,937,291,939,856
-1,073,741,822 to the power 5-14272476794136799727267287195… (47 digits)
First ten multiples-1,073,741,822, -2,147,483,644, -3,221,225,466, -4,294,967,288, -5,368,709,110, -6,442,450,932, -7,516,192,754, -8,589,934,576, -9,663,676,398, -10,737,418,220
Powers of twoBetween 2^29 (536,870,912) and 2^30 (1,073,741,824)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4No, remainder 2
Divisible by 5No, remainder 2
Divisible by 6No, remainder 2
Divisible by 7No, remainder 6
Divisible by 8No, remainder 6
Divisible by 9No, remainder 8
Divisible by 10No, remainder 2
Divisible by 11No, remainder 10
Divisible by 12No, remainder 2
Divisible by 100No, remainder 22
As a percentage & fraction
As a percentage-107,374,182,200%
-1,073,741,822% as a decimal-10,737,418.22
-1,073,741,822% of 100-1,073,741,822
-1,073,741,822% of 1,000-10,737,418,220
As a fraction of 100-1,073,741,822/100
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Neighbouring numbers
Derived from -1,073,741,822
Also reads as
1073741822 (identifier)
- 10 characters
- Checksum fails
1073741822 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.
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