Recognised as Number

33,890

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value33,890

Digit count5

Digit sum23

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 numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 3,389

Distinct prime factors32, 5, 3,389

Number of divisors8

Sum of divisors σ(n)61,020

Aliquot sum27,130sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

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

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

SquarefreeYesno repeated prime factor

All divisors1, 2, 5, 10, 3,389, 6,778, 16,945, 33,8908 in total

Arithmetic

Previous number33,889

Next number33,891

Double67,780

Half16,945

Square1,148,532,100

Cube38,923,752,869,000

Square root184.09236812≈irrational, shown to 9 decimal places

Cube root32.361143278≈

Negation-33,890

Reciprocal0.0000295072≈

Representations

Decimal33,890

Binary100001000110001016 bits

Octal102142

Hexadecimal8462

Base 36Q5E

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

In wordsthirty-three thousand, eight hundred and ninety

Ordinalthirty-three thousand, eight hundred and ninetieth

Scientific notation3.389 × 10^4

Engineering notation33.89 × 10^3

In other bases

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

Quinary2041030base 5; one hand: 7 digits

Septenary200543base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000010001100010

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

Bytes284 62

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

At each machine width

16-bit1000010001100010

32-bit00000000000000001000010001100010

64-bit0000000000000000000000000000000000000000000000001000010001100010

One's complement0111101110011101at 16 bits, every bit flipped

Bits reversed0100011000100001at 16 bits

Rotated left by 10000100011000101at 16 bits, wrapping

Shifted left by 110000100011000100= 67,780, no wrap

Shifted right by 1100001000110001= 16,945, discarding the low bit

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

Nearest landmarks

Next prime33,893+3

Previous prime33,889−1

Distance to nearest prime1

Nearest square below33,856

Nearest square above34,225

Powers & multiples

33,890 to the power 21,148,532,100

33,890 to the power 338,923,752,869,000

33,890 to the power 41,319,125,984,730,410,000

33,890 to the power 544,705,179,622,513,594,900,000

First ten multiples33,890, 67,780, 101,670, 135,560, 169,450, 203,340, 237,230, 271,120, 305,010, 338,900

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 3

Divisible by 8No, remainder 2

Divisible by 9No, remainder 5

Divisible by 10Yes

Divisible by 11No, remainder 10

Divisible by 12No, remainder 2

Divisible by 100No, remainder 90

Collatz (3n + 1) trajectory

Steps to reach 159the total stopping time

Highest value reached50,8361× the starting value

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

First steps33,890 → 16,945 → 50,836 → 25,418 → 12,709 → 38,128 → 19,064 → 9,532 → 4,766 → 2,383 → …

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

As a percentage & fraction

As a percentage3,389,000%

33,890% as a decimal338.9

33,890% of 10033,890

33,890% of 1,000338,900

As a fraction of 10033,890/100

Read another way

As seconds9 hours, 24 minutes and 50 seconds

As bytes33.096 KiB

As a 24-bit colour#008462

Keep nerding

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