Recognised as Number

39,333

Positive
Odd
Composite
5 digits

39,333 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 3.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value39,333

Digit count5

Digit sum21

Digit product729

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

Digital root3repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 7 × 1,873

Distinct prime factors33, 7, 1,873

Number of divisors8

Sum of divisors σ(n)59,968

Aliquot sum20,635sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)1,872the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 22,464

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 7, 21, 1,873, 5,619, 13,111, 39,3338 in total

Arithmetic

Previous number39,332

Next number39,334

Double78,666

Half19,666.5

Square1,547,084,889

Cube60,851,489,939,037

Square root198.325490041≈irrational, shown to 9 decimal places

Cube root34.008360113≈

Negation-39,333

Reciprocal0.0000254239≈

Representations

Decimal39,333

Binary100110011010010116 bits

Octal114645

Hexadecimal99A5

Base 36UCL

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

In wordsthirty-nine thousand, three hundred and thirty-three

Ordinalthirty-nine thousand, three hundred and thirty-third

Scientific notation3.9333 × 10^4

Engineering notation39.333 × 10^3

In other bases

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

Quinary2224313base 5; one hand: 7 digits

Septenary222450base 7: 6 digits

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

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

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

Sexagesimal10:55:33base 60; Babylonian, and still how an hour and a circle are divided: 3 digits

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

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

Bit-level

1001100110100101

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

Bytes299 a5

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

At each machine width

16-bit1001100110100101

32-bit00000000000000001001100110100101

64-bit0000000000000000000000000000000000000000000000001001100110100101

One's complement0110011001011010at 16 bits, every bit flipped

Bits reversed1010010110011001at 16 bits

Rotated left by 10011001101001011at 16 bits, wrapping

Shifted left by 110011001101001010= 78,666, no wrap

Shifted right by 1100110011010010= 19,666, discarding the low bit

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

Nearest landmarks

Next prime39,341+8

Previous prime39,323−10

Distance to nearest prime8

Nearest square below39,204

Nearest square above39,601

Powers & multiples

39,333 to the power 21,547,084,889

39,333 to the power 360,851,489,939,037

39,333 to the power 42,393,471,653,772,142,321

39,333 to the power 594,142,420,557,819,673,911,893

First ten multiples39,333, 78,666, 117,999, 157,332, 196,665, 235,998, 275,331, 314,664, 353,997, 393,330

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3Yes

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 3

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 3

Divisible by 10No, remainder 3

Divisible by 11No, remainder 8

Divisible by 12No, remainder 9

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 149the total stopping time

Highest value reached118,0003× the starting value

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

First steps39,333 → 118,000 → 59,000 → 29,500 → 14,750 → 7,375 → 22,126 → 11,063 → 33,190 → 16,595 → …

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

As a percentage & fraction

As a percentage3,933,300%

39,333% as a decimal393.33

39,333% of 10039,333

39,333% of 1,000393,330

As a fraction of 10039,333/100

Read another way

As seconds10 hours, 55 minutes and 33 seconds

As bytes38.411 KiB

As a 24-bit colour#0099A5

Keep nerding

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