Recognised as Number
33,210
- Positive
- Even
- Composite
- 5 digits
33,210 is an even 5-digit integer and a composite number. It has 40 divisors and a digital root of 9.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value33,210
Digit count5
Digit sum9
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum
Factors & divisors
Prime factorisation2 × 3^4 × 5 × 41
Distinct prime factors42, 3, 5, 41
Number of divisors40
Sum of divisors σ(n)91,476
Aliquot sum58,266sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)8,640integers below n that share no factor with it
Carmichael function λ(n)1,080the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 8,640
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 3, 5, 6, 9, 10, 15, 18, 27, 30, 41, 45, 54, 81, 82, 90, 123, 135, 162, 205, 246, 270, 369, 405, 410, 615, 738, 810, 1,107, 1,230, 1,845, 2,214, 3,321, 3,690, 5,535, 6,642, 11,070, 16,605, 33,21040 in total
Arithmetic
Representations
Decimal33,210
Binary100000011011101016 bits
Octal100672
Hexadecimal81BA
Base 36PMI
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordsthirty-three thousand, two hundred and ten
Ordinalthirty-three thousand, two hundred and tenth
Scientific notation3.321 × 10^4
Engineering notation33.21 × 10^3
In other bases
Ternary1200120000base 3; the most digit-efficient integer base after e: 10 digits
Quinary2030320base 5; one hand: 7 digits
Septenary165552base 7: 6 digits
Nonary50500base 9; each digit is two ternary digits: 5 digits
Duodecimal17276base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal430abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal9:13:30base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1TT01TT0000digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary11000011011001110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1000000110111010
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 even
Highest set bitbit 15worth 32,768
Lowest set bitbit 11 trailing zero
Power of twoNo
Bytes281 ba
Gray code1100000101100111n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1000000110111010
32-bit00000000000000001000000110111010
64-bit0000000000000000000000000000000000000000000000001000000110111010
One's complement0111111001000101at 16 bits, every bit flipped
Bits reversed0101110110000001at 16 bits
Rotated left by 10000001101110101at 16 bits, wrapping
Shifted left by 110000001101110100= 66,420, no wrap
Shifted right by 1100000011011101= 16,605, discarding the low bit
These bits as a double1.64079201 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
33,210 to the power 21,102,904,100
33,210 to the power 336,627,445,161,000
33,210 to the power 41,216,397,453,796,810,000
33,210 to the power 540,396,559,440,592,060,100,000
First ten multiples33,210, 66,420, 99,630, 132,840, 166,050, 199,260, 232,470, 265,680, 298,890, 332,100
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3Yes
Divisible by 4No, remainder 2
Divisible by 5Yes
Divisible by 6Yes
Divisible by 7No, remainder 2
Divisible by 8No, remainder 2
Divisible by 9Yes
Divisible by 10Yes
Divisible by 11No, remainder 1
Divisible by 12No, remainder 6
Divisible by 100No, remainder 10
Collatz (3n + 1) trajectory
Steps to reach 198the total stopping time
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps33,210 → 16,605 → 49,816 → 24,908 → 12,454 → 6,227 → 18,682 → 9,341 → 28,024 → 14,012 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage3,321,000%
33,210% as a decimal332.1
33,210% of 10033,210
33,210% of 1,000332,100
As a fraction of 10033,210/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 33,210
Nerdulate something else
Nothing in mind? Surprise me · today’s page