Nerdulator> put something in

Recognised as Number

-14,810,093

  • Negative
  • Odd
  • 8 digits

-14,810,093 is an odd 8-digit integer and the negative of 14,810,093. It has 2 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value14,810,093
Digit count8
Digit sum26
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 14,810,093
Distinct prime factors114,810,093
Number of divisors2
Sum of divisors σ(n)14,810,094
SquarefreeYesno repeated prime factor
All divisors1, 14,810,0932 in total

Arithmetic

Previous number-14,810,094
Next number-14,810,092
Cube-3,248,428,836,156,175,874,357
Cube root-245.576004165≈
Negation14,810,093
Reciprocal-6.75215206 × 10^-8≈

Representations

Decimal-14,810,093
Binary11100001111110111110110124 bits
Octal70375755
HexadecimalE1FBED
Base 368TFJH
In wordsminus fourteen million, eight hundred and ten thousand and ninety-three
Ordinalminus fourteen million, eight hundred and ten thousand and ninety-third
Scientific notation-1.4810093 × 10^7
Engineering notation-14.810093 × 10^6

In other bases

Ternary1000212102121222base 3; the most digit-efficient integer base after e: 16 digits
Quinary12242410333base 5; one hand: 11 digits
Septenary236612054base 7: 9 digits
Nonary30772558base 9; each digit is two ternary digits: 8 digits
Duodecimal4b627a5base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimal4cb54dbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal1:8:33:54:53base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT00T011TT0101001digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11011000100000010000010111base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111111000111100000010000010011
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
Bytes3e1 fb ed
Gray code100100010000011000011011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111111000111100000010000010011two's complement
64-bit1111111111111111111111111111111111111111000111100000010000010011two's complement
One's complement00000000111000011111101111101100at 32 bits, every bit flipped
Bits reversed11001000001000000111100011111111at 32 bits
Rotated left by 111111110001111000000100000100111at 32 bits, wrapping
Shifted left by 1-1110000111111011111011010= -29,620,186, no wrap
Shifted right by 1-11100001111110111110111= -7,405,046, discarding the low bit
These bits as a double7.31715816 × 10^-317≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+14,810,095
Nearest square below14,807,104
Nearest square above14,814,801

Powers & multiples

-14,810,093 to the power 2219,338,854,668,649
-14,810,093 to the power 3-3,248,428,836,156,175,874,357
-14,810,093 to the power 448,109,533,167,354,727,223,583,485,201
-14,810,093 to the power 5-712,506,660,395,108,074,170,903,209,090,933,693
First ten multiples-14,810,093, -29,620,186, -44,430,279, -59,240,372, -74,050,465, -88,860,558, -103,670,651, -118,480,744, -133,290,837, -148,100,930
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 3
Divisible by 6No, remainder 5
Divisible by 7No, remainder 4
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 1
Divisible by 12No, remainder 5
Divisible by 100No, remainder 93

As a percentage & fraction

As a percentage-1,481,009,300%
-14,810,093% as a decimal-148,100.93
-14,810,093% of 100-14,810,093
-14,810,093% of 1,000-148,100,930
As a fraction of 100-14,810,093/100

Keep nerding

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

Also reads as

14810093 (identifier)

  • 8 characters
  • Checksum valid

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