Nerdulator> put something in

Recognised as Number

-33,029,958

  • Negative
  • Even
  • 8 digits

-33,029,958 is an even 8-digit integer and the negative of 33,029,958. It has 16 divisors and a digital root of 3.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value33,029,958
Digit count8
Digit sum39
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root3repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 3 × 13 × 423,461
Distinct prime factors42, 3, 13, 423,461
Number of divisors16
Sum of divisors σ(n)71,141,616
SquarefreeYesno repeated prime factor
All divisors1, 2, 3, 6, 13, 26, 39, 78, 423,461, 846,922, 1,270,383, 2,540,766, 5,504,993, 11,009,986, 16,514,979, 33,029,95816 in total

Arithmetic

Previous number-33,029,959
Next number-33,029,957
Square1,090,978,125,481,764
Cube-36,034,961,663,581,394,685,912
Cube root-320.850465576
Negation33,029,958
Reciprocal-3.02755456 × 10^-8

Representations

Decimal-33,029,958
Binary111110111111111110100011025 bits
Octal175777506
Hexadecimal1F7FF46
Base 36JNY2U
In wordsminus thirty-three million, twenty-nine thousand, nine hundred and fifty-eight
Ordinalminus thirty-three million, twenty-nine thousand, nine hundred and fifty-eighth
Scientific notation-3.3029958 × 10^7
Engineering notation-33.029958 × 10^6

In other bases

Ternary2022011002120210base 3; the most digit-efficient integer base after e: 16 digits
Quinary31423424313base 5; one hand: 11 digits
Septenary550515153base 7: 9 digits
Nonary68132523base 9; each digit is two ternary digits: 8 digits
Duodecimalb08a686base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimala68ehibase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal2:32:54:59:18base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT1T010TT0T011T1T0digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000110000000000111001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111110000010000000000010111010
Bit length25 bitsto write the magnitude
Set bits19the population count, or Hamming weight
Zero bits6within that length
Bit parityodd19 set bits, so odd; not the same as the number itself being even
Highest set bitbit 24worth 16,777,216
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes401 f7 ff 46
Gray code1000011000000000011100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111110000010000000000010111010two's complement
64-bit1111111111111111111111111111111111111110000010000000000010111010two's complement
One's complement00000001111101111111111101000101at 32 bits, every bit flipped
Bits reversed01011101000000000001000001111111at 32 bits
Rotated left by 111111100000100000000000101110101at 32 bits, wrapping
Shifted left by 1-11111011111111111010001100= -66,059,916, no wrap
Shifted right by 1-111110111111111110100011= -16,514,979, discarding the low bit
These bits as a double1.63189675 × 10^-316IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+33,029,960
Nearest square below33,028,009
Nearest square above33,039,504

Powers & multiples

-33,029,958 to the power 21,090,978,125,481,764
-33,029,958 to the power 3-36,034,961,663,581,394,685,912
-33,029,958 to the power 41,190,233,270,279,703,596,057,096,551,696
-33,029,958 to the power 5-39,313,354,927,541,258,030,214,864,704,463,708,768
First ten multiples-33,029,958, -66,059,916, -99,089,874, -132,119,832, -165,149,790, -198,179,748, -231,209,706, -264,239,664, -297,269,622, -330,299,580
Powers of twoBetween 2^24 (16,777,216) and 2^25 (33,554,432)

Divisibility tests

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

As a percentage & fraction

As a percentage-3,302,995,800%
-33,029,958% as a decimal-330,299.58
-33,029,958% of 100-33,029,958
-33,029,958% of 1,000-330,299,580
As a fraction of 100-33,029,958/100

Keep nerding

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

Also reads as

33029958 (identifier)

  • 8 characters
  • Checksum fails

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