Recognised as Number

33,733

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value33,733

Digit count5

Digit sum19

Digit product567

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

Digital root1repeated digit sum

PalindromicYesreads the same backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation7 × 61 × 79

Distinct prime factors37, 61, 79

Number of divisors8

Sum of divisors σ(n)39,680

Aliquot sum5,947sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)780the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 28,080

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

SquarefreeYesno repeated prime factor

All divisors1, 7, 61, 79, 427, 553, 4,819, 33,7338 in total

Arithmetic

Previous number33,732

Next number33,734

Double67,466

Half16,866.5

Square1,137,915,289

Cube38,385,296,443,837

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

Cube root32.311093456≈

Negation-33,733

Reciprocal0.0000296446≈

Representations

Decimal33,733

Binary100000111100010116 bits

Octal101705

Hexadecimal83C5

Base 36Q11

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

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

Ordinalthirty-three thousand, seven hundred and thirty-third

Scientific notation3.3733 × 10^4

Engineering notation33.733 × 10^3

In other bases

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

Quinary2034413base 5; one hand: 7 digits

Septenary200230base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000001111000101

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 odd

Highest set bitbit 15worth 32,768

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes283 c5

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

At each machine width

16-bit1000001111000101

32-bit00000000000000001000001111000101

64-bit0000000000000000000000000000000000000000000000001000001111000101

One's complement0111110000111010at 16 bits, every bit flipped

Bits reversed1010001111000001at 16 bits

Rotated left by 10000011110001011at 16 bits, wrapping

Shifted left by 110000011110001010= 67,466, no wrap

Shifted right by 1100000111100010= 16,866, discarding the low bit

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

Nearest landmarks

Next prime33,739+6

Previous prime33,721−12

Distance to nearest prime6

Nearest square below33,489

Nearest square above33,856

Powers & multiples

33,733 to the power 21,137,915,289

33,733 to the power 338,385,296,443,837

33,733 to the power 41,294,851,204,939,953,521

33,733 to the power 543,679,215,696,239,452,123,893

First ten multiples33,733, 67,466, 101,199, 134,932, 168,665, 202,398, 236,131, 269,864, 303,597, 337,330

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 1

Divisible by 5No, remainder 3

Divisible by 6No, remainder 1

Divisible by 7Yes

Divisible by 8No, remainder 5

Divisible by 9No, remainder 1

Divisible by 10No, remainder 3

Divisible by 11No, remainder 7

Divisible by 12No, remainder 1

Divisible by 100No, remainder 33

Collatz (3n + 1) trajectory

Steps to reach 185the total stopping time

Highest value reached101,2003× the starting value

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

First steps33,733 → 101,200 → 50,600 → 25,300 → 12,650 → 6,325 → 18,976 → 9,488 → 4,744 → 2,372 → …

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

As a percentage & fraction

As a percentage3,373,300%

33,733% as a decimal337.33

33,733% of 10033,733

33,733% of 1,000337,330

As a fraction of 10033,733/100

Read another way

As seconds9 hours, 22 minutes and 13 seconds

As bytes32.942 KiB

As a 24-bit colour#0083C5

Keep nerding

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