Recognised as Number

33,170

Positive
Even
Composite
5 digits

33,170 is an even 5-digit integer and a composite number. It has 16 divisors and a digital root of 5.

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value33,170

Digit count5

Digit sum14

Digit product0zero, because one of the digits is zero

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

Digital root5repeated digit sum

PalindromicNoreads differently backwards

Happy numberYessquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 31 × 107

Distinct prime factors42, 5, 31, 107

Number of divisors16

Sum of divisors σ(n)62,208

Aliquot sum29,038sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 31, 62, 107, 155, 214, 310, 535, 1,070, 3,317, 6,634, 16,585, 33,17016 in total

Arithmetic

Previous number33,169

Next number33,171

Double66,340

Half16,585

Square1,100,248,900

Cube36,495,256,013,000

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

Cube root32.130327862≈

Negation-33,170

Reciprocal0.0000301477≈

Representations

Decimal33,170

Binary100000011001001016 bits

Octal100622

Hexadecimal8192

Base 36PLE

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

In wordsthirty-three thousand, one hundred and seventy

Ordinalthirty-three thousand, one hundred and seventieth

Scientific notation3.317 × 10^4

Engineering notation33.17 × 10^3

In other bases

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

Quinary2030140base 5; one hand: 7 digits

Septenary165464base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000000110010010

Bit length16 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits11within that length

Bit parityodd5 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 92

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

At each machine width

16-bit1000000110010010

32-bit00000000000000001000000110010010

64-bit0000000000000000000000000000000000000000000000001000000110010010

One's complement0111111001101101at 16 bits, every bit flipped

Bits reversed0100100110000001at 16 bits

Rotated left by 10000001100100101at 16 bits, wrapping

Shifted left by 110000001100100100= 66,340, no wrap

Shifted right by 1100000011001001= 16,585, discarding the low bit

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

Nearest landmarks

Next prime33,179+9

Previous prime33,161−9

Distance to nearest prime9

Nearest square below33,124

Nearest square above33,489

Powers & multiples

33,170 to the power 21,100,248,900

33,170 to the power 336,495,256,013,000

33,170 to the power 41,210,547,641,951,210,000

33,170 to the power 540,153,865,283,521,635,700,000

First ten multiples33,170, 66,340, 99,510, 132,680, 165,850, 199,020, 232,190, 265,360, 298,530, 331,700

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4No, remainder 2

Divisible by 5Yes

Divisible by 6No, remainder 2

Divisible by 7No, remainder 4

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 5

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1129the total stopping time

Highest value reached83,9682× the starting value

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

First steps33,170 → 16,585 → 49,756 → 24,878 → 12,439 → 37,318 → 18,659 → 55,978 → 27,989 → 83,968 → …

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

As a percentage & fraction

As a percentage3,317,000%

33,170% as a decimal331.7

33,170% of 10033,170

33,170% of 1,000331,700

As a fraction of 10033,170/100

Read another way

As seconds9 hours, 12 minutes and 50 seconds

As bytes32.393 KiB

As a 24-bit colour#008192

Keep nerding

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