Nerdulator> put something in

Recognised as Number

-383,688,000,004

  • Negative
  • Even
  • 12 digits

-383,688,000,004 is an even 12-digit integer and the negative of 383,688,000,004. It has 12 divisors and a digital root of 4.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value383,688,000,004
Digit count12
Digit sum40
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root4repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^2 × 83 × 1,155,686,747
Distinct prime factors32, 83, 1,155,686,747
Number of divisors12
Sum of divisors σ(n)679,543,807,824
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 83, 166, 332, 1,155,686,747, 2,311,373,494, 4,622,746,988, 95,922,000,001, 191,844,000,002, 383,688,000,00412 in total

Arithmetic

Previous number-383,688,000,005
Next number-383,688,000,003
Square147,216,481,347,069,504,000,016
Cube-56,485,197,295,683,269,776,146,417,024,000,064
Cube root-7,266.513290656
Reciprocal-2.60628427 × 10^-12

Representations

Decimal-383,688,000,004
Binary10110010101010110010110010000100000010039 bits
Octal5452545441004
Hexadecimal5955964204
Base 364W9HXFK4
In wordsminus three hundred and eighty-three billion, six hundred and eighty-eight million and four
Ordinalminus three hundred and eighty-three billion, six hundred and eighty-eight million and fourth
Scientific notation-3.83688 × 10^11
Engineering notation-383.688 × 10^9

In other bases

Ternary1100200100212122220122211base 3; the most digit-efficient integer base after e: 25 digits
Quinary22241243112000004base 5; one hand: 17 digits
Septenary36502101121501base 7: 14 digits
Nonary1320325586584base 9; each digit is two ternary digits: 13 digits
Duodecimal62440402804base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 11 digits
Vigesimalejf2a0004base 20; hands and feet, and the Mayan and Yoruba systems: 9 digits
Sexagesimal8:13:25:33:20:0:4base 60; Babylonian, and still how an hour and a circle are divided: 7 digits
Balanced ternaryTT0T100T0T01010001T1001TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1111101111111111101111101100001000001100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1111111111111111111111111010011010101010011010011011110111111100
Bit length39 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits24within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 38worth 274,877,906,944
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes559 55 96 42 04
Gray code111010111111111010111010110001100000110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

64-bit1111111111111111111111111010011010101010011010011011110111111100two's complement
One's complement0000000000000000000000000101100101010101100101100100001000000011at 64 bits, every bit flipped
Bits reversed0011111110111101100101100101010101100101111111111111111111111111at 64 bits
Rotated left by 11111111111111111111111110100110101010100110100110111101111111001at 64 bits, wrapping
Shifted left by 1-1011001010101011001011001000010000001000= -767,376,000,008, no wrap
Shifted right by 1-10110010101010110010110010000100000010= -191,844,000,002, discarding the low bit
These bits as a double1.8956706 × 10^-312IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+383,688,000,006
Nearest square below383,687,330,625
Nearest square above383,688,569,476

Powers & multiples

-383,688,000,004 to the power 2147,216,481,347,069,504,000,016
-383,688,000,004 to the power 3-56,485,197,295,683,269,776,146,417,024,000,064
-383,688,000,004 to the power 4216726923802120632030527995342… (47 digits)
-383,688,000,004 to the power 5-83155519940654968757737708004… (59 digits)
First ten multiples-383,688,000,004, -767,376,000,008, -1,151,064,000,012, -1,534,752,000,016, -1,918,440,000,020, -2,302,128,000,024, -2,685,816,000,028, -3,069,504,000,032, -3,453,192,000,036, -3,836,880,000,040
Powers of twoBetween 2^38 (274,877,906,944) and 2^39 (549,755,813,888)

Divisibility tests

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

As a percentage & fraction

As a percentage-38,368,800,000,400%
-383,688,000,004% as a decimal-3,836,880,000.04
-383,688,000,004% of 100-383,688,000,004
-383,688,000,004% of 1,000-3,836,880,000,040
As a fraction of 100-383,688,000,004/100

Keep nerding

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

Also reads as

383688000004 (identifier)

  • 12 characters
  • Checksum fails

383688000004 matches the shape of Luhn (cards, IMEI), GTIN-12 (UPC-A). 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-12 (UPC-A)Check digit does not matchGS1 mod 10, weights 3 and 1 alternating from the right

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