Nerdulator> put something in

Recognised as Number

-11,368,367

  • Negative
  • Odd
  • 8 digits

-11,368,367 is an odd 8-digit integer and the negative of 11,368,367. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value11,368,367
Digit count8
Digit sum35
Digit product18,144
Multiplicative persistence4times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 11,368,367
Distinct prime factors111,368,367
Number of divisors2
Sum of divisors σ(n)11,368,368
SquarefreeYesno repeated prime factor
All divisors1, 11,368,3672 in total

Arithmetic

Previous number-11,368,368
Next number-11,368,366
Cube-1,469,245,116,423,307,086,863
Cube root-224.853349705≈
Negation11,368,367
Reciprocal-8.79633812 × 10^-8≈

Representations

Decimal-11,368,367
Binary10101101011101111010111124 bits
Octal53273657
HexadecimalAD77AF
Base 366RNVZ
In wordsminus eleven million, three hundred and sixty-eight thousand, three hundred and sixty-seven
Ordinalminus eleven million, three hundred and sixty-eight thousand, three hundred and sixty-seventh
Scientific notation-1.1368367 × 10^7
Engineering notation-11.368367 × 10^6

In other bases

Ternary210101120110122base 3; the most digit-efficient integer base after e: 15 digits
Quinary10402241432base 5; one hand: 11 digits
Septenary165425633base 7: 9 digits
Nonary23346418base 9; each digit is two ternary digits: 8 digits
Duodecimal3982abbbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal3b10i7base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal52:37:52:47base 60; Babylonian, and still how an hour and a circle are divided: 4 digits
Balanced ternaryT1T0TT1110TTT101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11010101111001100001010001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111010100101000100001010001
Bit length24 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits7within that length
Bit parityodd17 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
Bytes3ad 77 af
Gray code111110111100110001111000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111010100101000100001010001two's complement
64-bit1111111111111111111111111111111111111111010100101000100001010001two's complement
One's complement00000000101011010111011110101110at 32 bits, every bit flipped
Bits reversed10001010000100010100101011111111at 32 bits
Rotated left by 111111110101001010001000010100011at 32 bits, wrapping
Shifted left by 1-1010110101110111101011110= -22,736,734, no wrap
Shifted right by 1-10101101011101111011000= -5,684,183, discarding the low bit
These bits as a double5.61671958 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+11,368,369
Nearest square below11,363,641
Nearest square above11,370,384

Powers & multiples

-11,368,367 to the power 2129,239,768,246,689
-11,368,367 to the power 3-1,469,245,116,423,307,086,863
-11,368,367 to the power 416,702,917,696,457,882,317,159,462,721
-11,368,367 to the power 5-189,884,898,344,127,806,224,279,169,735,146,607
First ten multiples-11,368,367, -22,736,734, -34,105,101, -45,473,468, -56,841,835, -68,210,202, -79,578,569, -90,946,936, -102,315,303, -113,683,670
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 3
Divisible by 5No, remainder 2
Divisible by 6No, remainder 5
Divisible by 7No, remainder 3
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 7
Divisible by 11No, remainder 10
Divisible by 12No, remainder 11
Divisible by 100No, remainder 67

As a percentage & fraction

As a percentage-1,136,836,700%
-11,368,367% as a decimal-113,683.67
-11,368,367% of 100-11,368,367
-11,368,367% of 1,000-113,683,670
As a fraction of 100-11,368,367/100

Keep nerding

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

Also reads as

11368367 (identifier)

  • 8 characters
  • Checksum fails

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