Nerdulator> put something in

Recognised as Number

-10,026,492

  • Negative
  • Even
  • 8 digits

-10,026,492 is an even 8-digit integer and the negative of 10,026,492. It has 24 divisors and a digital root of 6.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value10,026,492
Digit count8
Digit sum24
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root6repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^2 × 3 × 7 × 119,363
Distinct prime factors42, 3, 7, 119,363
Number of divisors24
Sum of divisors σ(n)26,737,536
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 4, 6, 7, 12, 14, 21, 28, 42, 84, 119,363, 238,726, 358,089, 477,452, 716,178, 835,541, 1,432,356, 1,671,082, 2,506,623, 3,342,164, 5,013,246, 10,026,49224 in total

Arithmetic

Previous number-10,026,493
Next number-10,026,491
Cube-1,007,968,673,374,696,087,488
Cube root-215.633552192
Negation10,026,492
Reciprocal-9.973578 × 10^-8

Representations

Decimal-10,026,492
Binary10011000111111011111110024 bits
Octal46176774
Hexadecimal98FDFC
Base 365YWHO
In wordsminus ten million, twenty-six thousand, four hundred and ninety-two
Ordinalminus ten million, twenty-six thousand, four hundred and ninety-second
Scientific notation-1.0026492 × 10^7
Engineering notation-10.026492 × 10^6

In other bases

Ternary200212101202120base 3; the most digit-efficient integer base after e: 15 digits
Quinary10031321432base 5; one hand: 11 digits
Septenary151136520base 7: 9 digits
Nonary20771676base 9; each digit is two ternary digits: 8 digits
Duodecimal3436450base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal32d64cbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal46:25:8:12base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT10T011TT11T0110digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101110110000011000000100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111011001110000001000000100
Bit length24 bitsto write the magnitude
Set bits16the population count, or Hamming weight
Zero bits8within that length
Bit parityeven16 set bits, so even; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes398 fd fc
Gray code110101001000001100000010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111011001110000001000000100two's complement
64-bit1111111111111111111111111111111111111111011001110000001000000100two's complement
One's complement00000000100110001111110111111011at 32 bits, every bit flipped
Bits reversed00100000010000001110011011111111at 32 bits
Rotated left by 111111110110011100000010000001001at 32 bits, wrapping
Shifted left by 1-1001100011111101111111000= -20,052,984, no wrap
Shifted right by 1-10011000111111011111110= -5,013,246, discarding the low bit
These bits as a double4.95374525 × 10^-317IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,026,494
Nearest square below10,023,556
Nearest square above10,029,889

Powers & multiples

-10,026,492 to the power 2100,530,541,826,064
-10,026,492 to the power 3-1,007,968,673,374,696,087,488
-10,026,492 to the power 410,106,389,839,842,003,323,629,732,096
-10,026,492 to the power 5-101,331,636,878,057,127,588,346,919,822,687,232
First ten multiples-10,026,492, -20,052,984, -30,079,476, -40,105,968, -50,132,460, -60,158,952, -70,185,444, -80,211,936, -90,238,428, -100,264,920
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

Divisibility tests

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

As a percentage & fraction

As a percentage-1,002,649,200%
-10,026,492% as a decimal-100,264.92
-10,026,492% of 100-10,026,492
-10,026,492% of 1,000-100,264,920
As a fraction of 100-10,026,492/100

Keep nerding

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

Also reads as

10026492 (identifier)

  • 8 characters
  • Checksum fails

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