Nerdulator> put something in

Recognised as Number

-33,533,330

  • Negative
  • Even
  • 8 digits

-33,533,330 is an even 8-digit integer and the negative of 33,533,330. It has 8 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2
SignNegative
Absolute value33,533,330
Digit count8
Digit sum23
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 2 × 5 × 3,353,333
Distinct prime factors32, 5, 3,353,333
Number of divisors8
Sum of divisors σ(n)60,360,012
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 3,353,333, 6,706,666, 16,766,665, 33,533,3308 in total

Arithmetic

Previous number-33,533,331
Next number-33,533,329
Square1,124,484,220,888,900
Cube-37,707,700,458,860,377,037,000
Cube root-322.472160728
Negation33,533,330
Reciprocal-2.98210765 × 10^-8

Representations

Decimal-33,533,330
Binary111111111101011011001001025 bits
Octal177726622
Hexadecimal1FFAD92
Base 36JYQHE
In wordsminus thirty-three million, five hundred and thirty-three thousand, three hundred and thirty
Ordinalminus thirty-three million, five hundred and thirty-three thousand, three hundred and thirtieth
Scientific notation-3.353333 × 10^7
Engineering notation-33.53333 × 10^6

In other bases

Ternary2100002200002012base 3; the most digit-efficient integer base after e: 16 digits
Quinary32041031310base 5; one hand: 11 digits
Septenary555012545base 7: 9 digits
Nonary70080065base 9; each digit is two ternary digits: 8 digits
Duodecimalb291a42base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimala9bd6abase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal2:35:14:48:50base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT1T000T01000T1T11digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000000101011110110010base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111110000000000101001001101110
Bit length25 bitsto write the magnitude
Set bits17the population count, or Hamming weight
Zero bits8within that length
Bit parityodd17 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 ff ad 92
Gray code1000000000111101101011011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111110000000000101001001101110two's complement
64-bit1111111111111111111111111111111111111110000000000101001001101110two's complement
One's complement00000001111111111010110110010001at 32 bits, every bit flipped
Bits reversed01110110010010100000000001111111at 32 bits
Rotated left by 111111100000000001010010011011101at 32 bits, wrapping
Shifted left by 1-11111111110101101100100100= -67,066,660, no wrap
Shifted right by 1-111111111101011011001001= -16,766,665, discarding the low bit
These bits as a double1.65676663 × 10^-316IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+33,533,332
Nearest square below33,524,100
Nearest square above33,535,681

Powers & multiples

-33,533,330 to the power 21,124,484,220,888,900
-33,533,330 to the power 3-37,707,700,458,860,377,037,000
-33,533,330 to the power 41,264,464,763,028,116,447,106,143,210,000
-33,533,330 to the power 5-42,401,714,171,993,628,099,237,845,288,189,300,000
First ten multiples-33,533,330, -67,066,660, -100,599,990, -134,133,320, -167,666,650, -201,199,980, -234,733,310, -268,266,640, -301,799,970, -335,333,300
Powers of twoBetween 2^24 (16,777,216) and 2^25 (33,554,432)

Divisibility tests

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

As a percentage & fraction

As a percentage-3,353,333,000%
-33,533,330% as a decimal-335,333.3
-33,533,330% of 100-33,533,330
-33,533,330% of 1,000-335,333,300
As a fraction of 100-33,533,330/100

Keep nerding

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

Also reads as

33533330 (identifier)

  • 8 characters
  • Checksum fails

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