Nerdulator> put something in

Recognised as Number

-10,082,129

  • Negative
  • Odd
  • 8 digits

-10,082,129 is an odd 8-digit integer and the negative of 10,082,129. It has 2 divisors and a digital root of 5.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value10,082,129
Digit count8
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 10,082,129
Distinct prime factors110,082,129
Number of divisors2
Sum of divisors σ(n)10,082,130
SquarefreeYesno repeated prime factor
All divisors1, 10,082,1292 in total

Arithmetic

Previous number-10,082,130
Next number-10,082,128
Cube-1,024,841,609,153,513,832,689
Cube root-216.031666882
Negation10,082,129
Reciprocal-9.91854002 × 10^-8

Representations

Decimal-10,082,129
Binary10011001110101110101000124 bits
Octal46353521
Hexadecimal99D751
Base 36603F5
In wordsminus ten million, eighty-two thousand, one hundred and twenty-nine
Ordinalminus ten million, eighty-two thousand, one hundred and twenty-ninth
Scientific notation-1.0082129 × 10^7
Engineering notation-10.082129 × 10^6

In other bases

Ternary200222020002012base 3; the most digit-efficient integer base after e: 15 digits
Quinary10040112004base 5; one hand: 11 digits
Septenary151460651base 7: 9 digits
Nonary20866065base 9; each digit is two ternary digits: 8 digits
Duodecimal3462695base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal330569base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:40:35:29base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T001T100T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110100111100111110011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111011001100010100010101111
Bit length24 bitsto write the magnitude
Set bits13the population count, or Hamming weight
Zero bits11within that length
Bit parityodd13 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes399 d7 51
Gray code110101010011110011111001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001100010100010101111two's complement
64-bit1111111111111111111111111111111111111111011001100010100010101111two's complement
One's complement00000000100110011101011101010000at 32 bits, every bit flipped
Bits reversed11110101000101000110011011111111at 32 bits
Rotated left by 111111110110011000101000101011111at 32 bits, wrapping
Shifted left by 1-1001100111010111010100010= -20,164,258, no wrap
Shifted right by 1-10011001110101110101001= -5,041,064, discarding the low bit
These bits as a double4.98123358 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,082,131
Nearest square below10,080,625
Nearest square above10,086,976

Powers & multiples

-10,082,129 to the power 2101,649,325,172,641
-10,082,129 to the power 3-1,024,841,609,153,513,832,689
-10,082,129 to the power 410,332,585,308,053,307,264,454,914,881
-10,082,129 to the power 5-104,174,457,979,298,182,716,871,566,514,261,649
First ten multiples-10,082,129, -20,164,258, -30,246,387, -40,328,516, -50,410,645, -60,492,774, -70,574,903, -80,657,032, -90,739,161, -100,821,290
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,008,212,900%
-10,082,129% as a decimal-100,821.29
-10,082,129% of 100-10,082,129
-10,082,129% of 1,000-100,821,290
As a fraction of 100-10,082,129/100

Keep nerding

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

Also reads as

10082129 (identifier)

  • 8 characters
  • Checksum fails

10082129 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. 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

Luhn (cards, IMEI)Check digit does not matchmod 10 with every second digit doubled
GTIN-8 (EAN-8)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right
ISSNCheck digit does not matchmod 11 with weights 8 down to 2; the check may be X

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 “-10082129” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.