Nerdulator> put something in

Recognised as Number

-10,513,262

  • Negative
  • Even
  • 8 digits

-10,513,262 is an even 8-digit integer and the negative of 10,513,262. It has 8 divisors and a digital root of 2.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value10,513,262
Digit count8
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 1,181 × 4,451
Distinct prime factors32, 1,181, 4,451
Number of divisors8
Sum of divisors σ(n)15,786,792
SquarefreeYesno repeated prime factor
All divisors1, 2, 1,181, 2,362, 4,451, 8,902, 5,256,631, 10,513,2628 in total

Arithmetic

Previous number-10,513,263
Next number-10,513,261
Cube-1,162,016,949,072,815,100,728
Cube root-219.068110561≈
Negation10,513,262
Reciprocal-9.51179567 × 10^-8≈

Representations

Decimal-10,513,262
Binary10100000011010110110111024 bits
Octal50065556
HexadecimalA06B6E
Base 3669C32
In wordsminus ten million, five hundred and thirteen thousand, two hundred and sixty-two
Ordinalminus ten million, five hundred and thirteen thousand, two hundred and sixty-second
Scientific notation-1.0513262 × 10^7
Engineering notation-10.513262 × 10^6

In other bases

Ternary201210010111002base 3; the most digit-efficient integer base after e: 15 digits
Quinary10142411022base 5; one hand: 11 digits
Septenary155234624base 7: 9 digits
Nonary21703432base 9; each digit is two ternary digits: 8 digits
Duodecimal3630092base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal35e332base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal48:40:21:2base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T11T00T0TTT0T1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary101000001001010110010110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111010111111001010010010010
Bit length24 bitsto write the magnitude
Set bits12the population count, or Hamming weight
Zero bits12within that length
Bit parityeven12 set bits, so even; not the same as the number itself being even
Highest set bitbit 23worth 8,388,608
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes3a0 6b 6e
Gray code111100000101111011011001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111010111111001010010010010two's complement
64-bit1111111111111111111111111111111111111111010111111001010010010010two's complement
One's complement00000000101000000110101101101101at 32 bits, every bit flipped
Bits reversed01001001001010011111101011111111at 32 bits
Rotated left by 111111110101111110010100100100101at 32 bits, wrapping
Shifted left by 1-1010000001101011011011100= -21,026,524, no wrap
Shifted right by 1-10100000011010110110111= -5,256,631, discarding the low bit
These bits as a double5.19424158 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+10,513,264
Nearest square below10,510,564
Nearest square above10,517,049

Powers & multiples

-10,513,262 to the power 2110,528,677,880,644
-10,513,262 to the power 3-1,162,016,949,072,815,100,728
-10,513,262 to the power 412,216,588,634,043,162,231,509,854,736
-10,513,262 to the power 5-128,436,197,055,917,883,848,367,758,421,508,832
First ten multiples-10,513,262, -21,026,524, -31,539,786, -42,053,048, -52,566,310, -63,079,572, -73,592,834, -84,106,096, -94,619,358, -105,132,620
Powers of twoBetween 2^23 (8,388,608) and 2^24 (16,777,216)

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 4
Divisible by 8No, remainder 6
Divisible by 9No, remainder 2
Divisible by 10No, remainder 2
Divisible by 11No, remainder 1
Divisible by 12No, remainder 2
Divisible by 100No, remainder 62

As a percentage & fraction

As a percentage-1,051,326,200%
-10,513,262% as a decimal-105,132.62
-10,513,262% of 100-10,513,262
-10,513,262% of 1,000-105,132,620
As a fraction of 100-10,513,262/100

Keep nerding

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

Also reads as

10513262 (identifier)

  • 8 characters
  • Checksum valid

10513262 matches the shape of Luhn (cards, IMEI), GTIN-8 (EAN-8), ISSN. The check digit is valid for GTIN-8 (EAN-8). 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 validGS1 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 “-10513262” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.