Recognised as Number

33,770

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value33,770

Digit count5

Digit sum20

Digit product0zero, because one of the digits is zero

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

Digital root2repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 11 × 307

Distinct prime factors42, 5, 11, 307

Number of divisors16

Sum of divisors σ(n)66,528

Aliquot sum32,758sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 11, 22, 55, 110, 307, 614, 1,535, 3,070, 3,377, 6,754, 16,885, 33,77016 in total

Arithmetic

Previous number33,769

Next number33,771

Double67,540

Half16,885

Square1,140,412,900

Cube38,511,743,633,000

Square root183.766155752≈irrational, shown to 9 decimal places

Cube root32.3229026≈

Negation-33,770

Reciprocal0.0000296121≈

Representations

Decimal33,770

Binary100000111110101016 bits

Octal101752

Hexadecimal83EA

Base 36Q22

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

In wordsthirty-three thousand, seven hundred and seventy

Ordinalthirty-three thousand, seven hundred and seventieth

Scientific notation3.377 × 10^4

Engineering notation33.77 × 10^3

In other bases

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

Quinary2040040base 5; one hand: 7 digits

Septenary200312base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000001111101010

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 even

Highest set bitbit 15worth 32,768

Lowest set bitbit 11 trailing zero

Power of twoNo

Bytes283 ea

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

At each machine width

16-bit1000001111101010

32-bit00000000000000001000001111101010

64-bit0000000000000000000000000000000000000000000000001000001111101010

One's complement0111110000010101at 16 bits, every bit flipped

Bits reversed0101011111000001at 16 bits

Rotated left by 10000011111010101at 16 bits, wrapping

Shifted left by 110000011111010100= 67,540, no wrap

Shifted right by 1100000111110101= 16,885, discarding the low bit

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

Nearest landmarks

Next prime33,773+3

Previous prime33,769−1

Distance to nearest prime1

Nearest square below33,489

Nearest square above33,856

Powers & multiples

33,770 to the power 21,140,412,900

33,770 to the power 338,511,743,633,000

33,770 to the power 41,300,541,582,486,410,000

33,770 to the power 543,919,289,240,566,065,700,000

First ten multiples33,770, 67,540, 101,310, 135,080, 168,850, 202,620, 236,390, 270,160, 303,930, 337,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 2

Divisible by 8No, remainder 2

Divisible by 9No, remainder 2

Divisible by 10Yes

Divisible by 11Yes

Divisible by 12No, remainder 2

Divisible by 100No, remainder 70

Collatz (3n + 1) trajectory

Steps to reach 1173the total stopping time

Highest value reached250,5047× the starting value

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

First steps33,770 → 16,885 → 50,656 → 25,328 → 12,664 → 6,332 → 3,166 → 1,583 → 4,750 → 2,375 → …

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

As a percentage & fraction

As a percentage3,377,000%

33,770% as a decimal337.7

33,770% of 10033,770

33,770% of 1,000337,700

As a fraction of 10033,770/100

Read another way

As seconds9 hours, 22 minutes and 50 seconds

As bytes32.979 KiB

As a 24-bit colour#0083EA

Keep nerding

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