Nerdulator> put something in

Recognised as Number

-33,533,333

  • Negative
  • Odd
  • 8 digits

-33,533,333 is an odd 8-digit integer and the negative of 33,533,333. It has 16 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value33,533,333
Digit count8
Digit sum26
Digit product10,935
Multiplicative persistence2times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 17 × 23 × 139 × 617
Distinct prime factors417, 23, 139, 617
Number of divisors16
Sum of divisors σ(n)37,376,640
SquarefreeYesno repeated prime factor
All divisors1, 17, 23, 139, 391, 617, 2,363, 3,197, 10,489, 14,191, 54,349, 85,763, 241,247, 1,457,971, 1,972,549, 33,533,33316 in total

Arithmetic

Previous number-33,533,334
Next number-33,533,332
Square1,124,484,422,088,889
Cube-37,707,710,579,219,270,437,037
Cube root-322.472170345
Negation33,533,333
Reciprocal-2.98210739 × 10^-8

Representations

Decimal-33,533,333
Binary111111111101011011001010125 bits
Octal177726625
Hexadecimal1FFAD95
Base 36JYQHH
In wordsminus thirty-three million, five hundred and thirty-three thousand, three hundred and thirty-three
Ordinalminus thirty-three million, five hundred and thirty-three thousand, three hundred and thirty-third
Scientific notation-3.3533333 × 10^7
Engineering notation-33.533333 × 10^6

In other bases

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

Bit-level

11111110000000000101001001101011
Bit length25 bitsto write the magnitude
Set bits18the population count, or Hamming weight
Zero bits7within that length
Bit parityeven18 set bits, so even; not the same as the number itself being odd
Highest set bitbit 24worth 16,777,216
Lowest set bitbit 00 trailing zeros
Power of twoNo
Bytes401 ff ad 95
Gray code1000000000111101101011111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111110000000000101001001101011two's complement
64-bit1111111111111111111111111111111111111110000000000101001001101011two's complement
One's complement00000001111111111010110110010100at 32 bits, every bit flipped
Bits reversed11010110010010100000000001111111at 32 bits
Rotated left by 111111100000000001010010011010111at 32 bits, wrapping
Shifted left by 1-11111111110101101100101010= -67,066,666, no wrap
Shifted right by 1-111111111101011011001011= -16,766,666, discarding the low bit
These bits as a double1.65676678 × 10^-316IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

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

Powers & multiples

-33,533,333 to the power 21,124,484,422,088,889
-33,533,333 to the power 3-37,707,710,579,219,270,437,037
-33,533,333 to the power 41,264,465,215,520,582,675,582,217,254,321
-33,533,333 to the power 5-42,401,733,138,968,467,214,329,460,067,491,781,893
First ten multiples-33,533,333, -67,066,666, -100,599,999, -134,133,332, -167,666,665, -201,199,998, -234,733,331, -268,266,664, -301,799,997, -335,333,330
Powers of twoBetween 2^24 (16,777,216) and 2^25 (33,554,432)

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 1
Divisible by 8No, remainder 5
Divisible by 9No, remainder 8
Divisible by 10No, remainder 3
Divisible by 11No, remainder 9
Divisible by 12No, remainder 5
Divisible by 100No, remainder 33

As a percentage & fraction

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

Keep nerding

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

Also reads as

33533333 (identifier)

  • 8 characters
  • Checksum fails

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