Nerdulator> put something in

Recognised as Number

-59,742,128

  • Negative
  • Even
  • 8 digits

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

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value59,742,128
Digit count8
Digit sum38
Digit product40,320
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2^4 × 3,733,883
Distinct prime factors22, 3,733,883
Number of divisors10
Sum of divisors σ(n)115,750,404
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 8, 16, 3,733,883, 7,467,766, 14,935,532, 29,871,064, 59,742,12810 in total

Arithmetic

Previous number-59,742,129
Next number-59,742,127
Square3,569,121,857,968,384
Cube-213,226,934,886,345,016,881,152
Cube root-390.925106065
Negation59,742,128
Reciprocal-1.6738607 × 10^-8

Representations

Decimal-59,742,128
Binary1110001111100101111011000026 bits
Octal343713660
Hexadecimal38F97B0
Base 36ZKHBK
In wordsminus fifty-nine million, seven hundred and forty-two thousand, one hundred and twenty-eight
Ordinalminus fifty-nine million, seven hundred and forty-two thousand, one hundred and twenty-eighth
Scientific notation-5.9742128 × 10^7
Engineering notation-59.742128 × 10^6

In other bases

Ternary11011102012210102base 3; the most digit-efficient integer base after e: 17 digits
Quinary110243222003base 5; one hand: 12 digits
Septenary1323541205base 7: 10 digits
Nonary134365712base 9; each digit is two ternary digits: 9 digits
Duodecimal18010ba8base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 8 digits
Vigesimalid7f68base 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal4:36:35:2:8base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryTT0TTTT1T101T0TT1digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary1101101100011011100001010000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111100011100000110100001010000
Bit length26 bitsto write the magnitude
Set bits15the population count, or Hamming weight
Zero bits11within that length
Bit parityodd15 set bits, so odd; not the same as the number itself being even
Highest set bitbit 25worth 33,554,432
Lowest set bitbit 44 trailing zeros
Power of twoNo
Bytes403 8f 97 b0
Gray code10010010000101110001101000n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111100011100000110100001010000two's complement
64-bit1111111111111111111111111111111111111100011100000110100001010000two's complement
One's complement00000011100011111001011110101111at 32 bits, every bit flipped
Bits reversed00001010000101100000111000111111at 32 bits
Rotated left by 111111000111000001101000010100001at 32 bits, wrapping
Shifted left by 1-111000111110010111101100000= -119,484,256, no wrap
Shifted right by 1-1110001111100101111011000= -29,871,064, discarding the low bit
These bits as a double2.95165331 × 10^-316IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+59,742,130
Nearest square below59,737,441
Nearest square above59,752,900

Powers & multiples

-59,742,128 to the power 23,569,121,857,968,384
-59,742,128 to the power 3-213,226,934,886,345,016,881,152
-59,742,128 to the power 412,738,630,837,027,689,450,675,943,571,456
-59,742,128 to the power 5-761,032,914,010,455,362,706,531,907,366,701,498,368
First ten multiples-59,742,128, -119,484,256, -179,226,384, -238,968,512, -298,710,640, -358,452,768, -418,194,896, -477,937,024, -537,679,152, -597,421,280
Powers of twoBetween 2^25 (33,554,432) and 2^26 (67,108,864)

Divisibility tests

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

As a percentage & fraction

As a percentage-5,974,212,800%
-59,742,128% as a decimal-597,421.28
-59,742,128% of 100-59,742,128
-59,742,128% of 1,000-597,421,280
As a fraction of 100-59,742,128/100

Keep nerding

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

Also reads as

59742128 (identifier)

  • 8 characters
  • Checksum valid

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