Recognised as Number

33,731

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value33,731

Digit count5

Digit sum17

Digit product189

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

Digital root8repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation89 × 379

Distinct prime factors289, 379

Number of divisors4

Sum of divisors σ(n)34,200

Aliquot sum469sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)16,632the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,264

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

SquarefreeYesno repeated prime factor

All divisors1, 89, 379, 33,7314 in total

Arithmetic

Previous number33,730

Next number33,732

Double67,462

Half16,865.5

Square1,137,780,361

Cube38,378,469,356,891

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

Cube root32.310454877≈

Negation-33,731

Reciprocal0.0000296463≈

Representations

Decimal33,731

Binary100000111100001116 bits

Octal101703

Hexadecimal83C3

Base 36Q0Z

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

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

Ordinalthirty-three thousand, seven hundred and thirty-first

Scientific notation3.3731 × 10^4

Engineering notation33.731 × 10^3

In other bases

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

Quinary2034411base 5; one hand: 7 digits

Septenary200225base 7: 6 digits

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

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

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

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

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

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

Bit-level

1000001111000011

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 c3

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

At each machine width

16-bit1000001111000011

32-bit00000000000000001000001111000011

64-bit0000000000000000000000000000000000000000000000001000001111000011

One's complement0111110000111100at 16 bits, every bit flipped

Bits reversed1100001111000001at 16 bits

Rotated left by 10000011110000111at 16 bits, wrapping

Shifted left by 110000011110000110= 67,462, no wrap

Shifted right by 1100000111100001= 16,865, discarding the low bit

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

Nearest landmarks

Next prime33,739+8

Previous prime33,721−10

Distance to nearest prime8

Nearest square below33,489

Nearest square above33,856

Powers & multiples

33,731 to the power 21,137,780,361

33,731 to the power 338,378,469,356,891

33,731 to the power 41,294,544,149,877,290,321

33,731 to the power 543,666,268,719,510,879,817,651

First ten multiples33,731, 67,462, 101,193, 134,924, 168,655, 202,386, 236,117, 269,848, 303,579, 337,310

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 2

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 5

Divisible by 7No, remainder 5

Divisible by 8No, remainder 3

Divisible by 9No, remainder 8

Divisible by 10No, remainder 1

Divisible by 11No, remainder 5

Divisible by 12No, remainder 11

Divisible by 100No, remainder 31

Collatz (3n + 1) trajectory

Steps to reach 167the total stopping time

Highest value reached151,7924× the starting value

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

First steps33,731 → 101,194 → 50,597 → 151,792 → 75,896 → 37,948 → 18,974 → 9,487 → 28,462 → 14,231 → …

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

As a percentage & fraction

As a percentage3,373,100%

33,731% as a decimal337.31

33,731% of 10033,731

33,731% of 1,000337,310

As a fraction of 10033,731/100

Read another way

As seconds9 hours, 22 minutes and 11 seconds

As bytes32.94 KiB

As a 24-bit colour#0083C3

Keep nerding

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