Nerdulator> put something in

Recognised as Number

-33,537,959

  • Negative
  • Odd
  • 8 digits

-33,537,959 is an odd 8-digit integer and the negative of 33,537,959. It has 32 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2
SignNegative
Absolute value33,537,959
Digit count8
Digit sum44
Digit product382,725
Multiplicative persistence3times the digit product can be taken before one digit is left
Digital root8repeated digit sum
PalindromicNoreads differently backwards

Factors & divisors

Prime factorisation−1 × 7 × 13 × 41 × 89 × 101
Distinct prime factors57, 13, 41, 89, 101
Number of divisors32
Sum of divisors σ(n)43,182,720
SquarefreeYesno repeated prime factor
All divisors1, 7, 13, 41, 89, 91, 101, 287, 533, 623, 707, 1,157, 1,313, 3,649, 3,731, 4,141, 8,099, 8,989, 9,191, 25,543, 28,987, 47,437, 53,833, 62,923, 116,857, 332,059, 368,549, 376,831, 817,999, 2,579,843, 4,791,137, 33,537,95932 in total

Arithmetic

Previous number-33,537,960
Next number-33,537,958
Square1,124,794,693,885,681
Cube-37,723,318,326,955,520,065,079
Cube root-322.486998254
Negation33,537,959
Reciprocal-2.98169605 × 10^-8

Representations

Decimal-33,537,959
Binary111111111101111111010011125 bits
Octal177737647
Hexadecimal1FFBFA7
Base 36JYU1Z
In wordsminus thirty-three million, five hundred and thirty-seven thousand, nine hundred and fifty-nine
Ordinalminus thirty-three million, five hundred and thirty-seven thousand, nine hundred and fifty-ninth
Scientific notation-3.3537959 × 10^7
Engineering notation-33.537959 × 10^6

In other bases

Ternary2100002220102122base 3; the most digit-efficient integer base after e: 16 digits
Quinary32041203314base 5; one hand: 11 digits
Septenary555032210base 7: 9 digits
Nonary70086378base 9; each digit is two ternary digits: 8 digits
Duodecimalb29465bbase 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 7 digits
Vigesimala9c4hjbase 20; hands and feet, and the Mayan and Yoruba systems: 6 digits
Sexagesimal2:35:16:5:59base 60; Babylonian, and still how an hour and a circle are divided: 5 digits
Balanced ternaryT1T000T0010TT0101digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000000000100000110101001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

11111110000000000100000001011001
Bit length25 bitsto write the magnitude
Set bits21the population count, or Hamming weight
Zero bits4within that length
Bit parityodd21 set bits, so odd; 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 bf a7
Gray code1000000000110000001110100n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit11111110000000000100000001011001two's complement
64-bit1111111111111111111111111111111111111110000000000100000001011001two's complement
One's complement00000001111111111011111110100110at 32 bits, every bit flipped
Bits reversed10011010000000100000000001111111at 32 bits
Rotated left by 111111100000000001000000010110011at 32 bits, wrapping
Shifted left by 1-11111111110111111101001110= -67,075,918, no wrap
Shifted right by 1-111111111101111111010100= -16,768,979, discarding the low bit
These bits as a double1.65699534 × 10^-316IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime2+33,537,961
Nearest square below33,535,681
Nearest square above33,547,264

Powers & multiples

-33,537,959 to the power 21,124,794,693,885,681
-33,537,959 to the power 3-37,723,318,326,955,520,065,079
-33,537,959 to the power 41,265,163,103,393,382,826,766,296,833,761
-33,537,959 to the power 5-42,430,988,289,920,034,115,392,165,792,506,233,799
First ten multiples-33,537,959, -67,075,918, -100,613,877, -134,151,836, -167,689,795, -201,227,754, -234,765,713, -268,303,672, -301,841,631, -335,379,590
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 3
Divisible by 5No, remainder 4
Divisible by 6No, remainder 5
Divisible by 7Yes
Divisible by 8No, remainder 7
Divisible by 9No, remainder 8
Divisible by 10No, remainder 9
Divisible by 11No, remainder 4
Divisible by 12No, remainder 11
Divisible by 100No, remainder 59

As a percentage & fraction

As a percentage-3,353,795,900%
-33,537,959% as a decimal-335,379.59
-33,537,959% of 100-33,537,959
-33,537,959% of 1,000-335,379,590
As a fraction of 100-33,537,959/100

Keep nerding

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

Also reads as

33537959 (identifier)

  • 8 characters
  • Checksum fails

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