Recognised as Number

33,211

Positive
Odd
Prime
5 digits

33,211 is an odd 5-digit integer and a prime number. It has 2 divisors and a digital root of 1.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityPrime

Absolute value33,211

Digit count5

Digit sum10

Digit product18

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

Digital root1repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation33,211

Distinct prime factors133,211

Number of divisors2

Sum of divisors σ(n)33,212

Aliquot sum1sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)33,210the smallest exponent with aˣ ≡ 1 for every unit coprime to n

Möbius function μ(n)−11 distinct prime factor, an odd number of them

SquarefreeYesno repeated prime factor

All divisors1, 33,2112 in total

Arithmetic

Previous number33,210

Next number33,212

Double66,422

Half16,605.5

Square1,102,970,521

Cube36,630,753,972,931

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

Cube root32.143560714≈

Negation-33,211

Reciprocal0.0000301105≈

Representations

Decimal33,211

Binary100000011011101116 bits

Octal100673

Hexadecimal81BB

Base 36PMJ

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

In wordsthirty-three thousand, two hundred and eleven

Ordinalthirty-three thousand, two hundred and eleventh

Scientific notation3.3211 × 10^4

Engineering notation33.211 × 10^3

In other bases

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

Quinary2030321base 5; one hand: 7 digits

Septenary165553base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000000110111011

Bit length16 bitsto write the magnitude

Set bits8the population count, or Hamming weight

Zero bits8within that length

Bit parityeven8 set bits, so even; 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 bb

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

At each machine width

16-bit1000000110111011

32-bit00000000000000001000000110111011

64-bit0000000000000000000000000000000000000000000000001000000110111011

One's complement0111111001000100at 16 bits, every bit flipped

Bits reversed1101110110000001at 16 bits

Rotated left by 10000001101110111at 16 bits, wrapping

Shifted left by 110000001101110110= 66,422, no wrap

Shifted right by 1100000011011101= 16,605, discarding the low bit

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

Nearest landmarks

Next prime33,223+12

Previous prime33,203−8

Distance to nearest prime0, it is prime

Nearest square below33,124

Nearest square above33,489

Powers & multiples

33,211 to the power 21,102,970,521

33,211 to the power 336,630,753,972,931

33,211 to the power 41,216,543,970,195,011,441

33,211 to the power 540,402,641,794,146,524,967,051

First ten multiples33,211, 66,422, 99,633, 132,844, 166,055, 199,266, 232,477, 265,688, 298,899, 332,110

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 3

Divisible by 8No, remainder 3

Divisible by 9No, remainder 1

Divisible by 10No, remainder 1

Divisible by 11No, remainder 2

Divisible by 12No, remainder 7

Divisible by 100No, remainder 11

Collatz (3n + 1) trajectory

Steps to reach 1160the total stopping time

Highest value reached168,1365× the starting value

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

First steps33,211 → 99,634 → 49,817 → 149,452 → 74,726 → 37,363 → 112,090 → 56,045 → 168,136 → 84,068 → …

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

As a percentage & fraction

As a percentage3,321,100%

33,211% as a decimal332.11

33,211% of 10033,211

33,211% of 1,000332,110

As a fraction of 10033,211/100

Read another way

As seconds9 hours, 13 minutes and 31 seconds

As bytes32.433 KiB

As a 24-bit colour#0081BB

Keep nerding

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