Nerdulator> put something in

Recognised as Number

-26,213,473

  • Negative
  • Odd
  • 8 digits

-26,213,473 is an odd 8-digit integer and the negative of 26,213,473. It has 32 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value26,213,473
Digit count8
Digit sum28
Digit product6,048
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root1repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 11 × 13 × 17 × 41 × 263
Distinct prime factors511, 13, 17, 41, 263
Number of divisors32
Sum of divisors σ(n)33,530,112
SquarefreeYesno repeated prime factor
All divisors1, 11, 13, 17, 41, 143, 187, 221, 263, 451, 533, 697, 2,431, 2,893, 3,419, 4,471, 5,863, 7,667, 9,061, 10,783, 37,609, 49,181, 58,123, 99,671, 118,613, 140,179, 183,311, 639,353, 1,541,969, 2,016,421, 2,383,043, 26,213,47332 in total

Arithmetic

Previous number-26,213,474
Next number-26,213,472
Cube-18,012,487,488,413,541,654,817
Cube root-297.058183721
Negation26,213,473
Reciprocal-3.81483217 × 10^-8

Representations

Decimal-26,213,473
Binary110001111111111000110000125 bits
Octal143776141
Hexadecimal18FFC61
Base 36FLUG1
In wordsminus twenty-six million, two hundred and thirteen thousand, four hundred and seventy-three
Ordinalminus twenty-six million, two hundred and thirteen thousand, four hundred and seventy-third
Scientific notation-2.6213473 × 10^7
Engineering notation-26.213473 × 10^6

In other bases

Ternary1211022210010101base 3; the most digit-efficient integer base after e: 16 digits
Quinary23202312343base 5; one hand: 11 digits
Septenary435545056base 7: 9 digits
Nonary54283111base 9; each digit is two ternary digits: 8 digits
Duodecimal8941a01base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal83gdddbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal2:1:21:31:13base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT11TTT001T00T0T0Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11101100000000010011100011base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111110011100000000001110011111
Bit length25 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits10within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being odd
Highest set bitbit 24worth 16,777,216
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes401 8f fc 61
Gray code1010010000000001001010001n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111110011100000000001110011111two's complement
64-bit1111111111111111111111111111111111111110011100000000001110011111two's complement
One's complement00000001100011111111110001100000at 32 bits, every bit flipped
Bits reversed11111001110000000000111001111111at 32 bits
Rotated left by 111111100111000000000011100111111at 32 bits, wrapping
Shifted left by 1-11000111111111100011000010= -52,426,946, no wrap
Shifted right by 1-110001111111111000110001= -13,106,736, discarding the low bit
These bits as a double1.29511765 × 10^-316IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+26,213,475
Nearest square below26,204,161
Nearest square above26,214,400

Powers & multiples

-26,213,473 to the power 2687,146,166,721,729
-26,213,473 to the power 3-18,012,487,488,413,541,654,817
-26,213,473 to the power 4472,169,854,440,366,187,002,920,749,441
-26,213,473 to the power 5-12,377,211,730,786,469,153,114,013,986,611,418,593
First ten multiples-26,213,473, -52,426,946, -78,640,419, -104,853,892, -131,067,365, -157,280,838, -183,494,311, -209,707,784, -235,921,257, -262,134,730
Powers of twoBetween 2^24 (16,777,216) and 2^25 (33,554,432)

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 6
Divisible by 8No, remainder 1
Divisible by 9No, remainder 1
Divisible by 10No, remainder 3
Divisible by 11Yes
Divisible by 12No, remainder 1
Divisible by 100No, remainder 73

As a percentage & fraction

As a percentage-2,621,347,300%
-26,213,473% as a decimal-262,134.73
-26,213,473% of 100-26,213,473
-26,213,473% of 1,000-262,134,730
As a fraction of 100-26,213,473/100

Keep nerding

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

Also reads as

26213473 (identifier)

  • 8 characters
  • Checksum fails

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