Recognised as Number

33,209

Positive
Odd
Composite
5 digits

33,209 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 8.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value33,209

Digit count5

Digit sum17

Digit product0zero, because one of the digits is zero

Multiplicative persistence1times the digit product can be taken before one digit is left

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation11 × 3,019

Distinct prime factors211, 3,019

Number of divisors4

Sum of divisors σ(n)36,240

Aliquot sum3,031sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

Euler's totient φ(n)30,180integers below n that share no factor with it

Carmichael function λ(n)15,090the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,180

Möbius function μ(n)+12 distinct prime factors, an even number of them

SquarefreeYesno repeated prime factor

All divisors1, 11, 3,019, 33,2094 in total

Arithmetic

Previous number33,208

Next number33,210

Double66,418

Half16,604.5

Square1,102,837,681

Cube36,624,136,548,329

Square root182.233366868≈irrational, shown to 9 decimal places

Cube root32.142915461≈

Negation-33,209

Reciprocal0.0000301123≈

Representations

Decimal33,209

Binary100000011011100116 bits

Octal100671

Hexadecimal81B9

Base 36PMH

Roman numeralNot defined above 3,999there is no agreed standard notation

In wordsthirty-three thousand, two hundred and nine

Ordinalthirty-three thousand, two hundred and ninth

Scientific notation3.3209 × 10^4

Engineering notation33.209 × 10^3

In other bases

Ternary1200112222base 3; the most digit-efficient integer base after e: 10 digits

Quinary2030314base 5; one hand: 7 digits

Septenary165551base 7: 6 digits

Nonary50488base 9; each digit is two ternary digits: 5 digits

Duodecimal17275base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits

Vigesimal4309base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits

Sexagesimal9:13:29base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

Balanced ternary1TT01TT000Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed

Negabinary11000011011001001base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

1000000110111001

Bit length16 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits9within that length

Bit parityodd7 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes281 b9

Gray code1100000101100101n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

16-bit1000000110111001

32-bit00000000000000001000000110111001

64-bit0000000000000000000000000000000000000000000000001000000110111001

One's complement0111111001000110at 16 bits, every bit flipped

Bits reversed1001110110000001at 16 bits

Rotated left by 10000001101110011at 16 bits, wrapping

Shifted left by 110000001101110010= 66,418, no wrap

Shifted right by 1100000011011100= 16,604, discarding the low bit

These bits as a double1.6407426 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime33,211+2

Previous prime33,203−6

Distance to nearest prime2

Nearest square below33,124

Nearest square above33,489

Powers & multiples

33,209 to the power 21,102,837,681

33,209 to the power 336,624,136,548,329

33,209 to the power 41,216,250,950,633,457,761

33,209 to the power 540,390,477,819,586,498,785,049

First ten multiples33,209, 66,418, 99,627, 132,836, 166,045, 199,254, 232,463, 265,672, 298,881, 332,090

Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 1

Divisible by 5No, remainder 4

Divisible by 6No, remainder 5

Divisible by 7No, remainder 1

Divisible by 8No, remainder 1

Divisible by 9No, remainder 8

Divisible by 10No, remainder 9

Divisible by 11Yes

Divisible by 12No, remainder 5

Divisible by 100No, remainder 9

Collatz (3n + 1) trajectory

Steps to reach 141the total stopping time

Highest value reached112,0843× the starting value

Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven

First steps33,209 → 99,628 → 49,814 → 24,907 → 74,722 → 37,361 → 112,084 → 56,042 → 28,021 → 84,064 → …

Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage3,320,900%

33,209% as a decimal332.09

33,209% of 10033,209

33,209% of 1,000332,090

As a fraction of 10033,209/100

Read another way

As seconds9 hours, 13 minutes and 29 seconds

As bytes32.431 KiB

As a 24-bit colour#0081B9

Keep nerding

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