Recognised as Number

65,733

Positive
Odd
Composite
5 digits

65,733 is an odd 5-digit integer and a composite number. It has 4 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value65,733

Digit count5

Digit sum24

Digit product1,890

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

Digital root6repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation3 × 21,911

Distinct prime factors23, 21,911

Number of divisors4

Sum of divisors σ(n)87,648

Aliquot sum21,915sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)21,910the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 43,820

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 21,911, 65,7334 in total

Arithmetic

Previous number65,732

Next number65,734

Double131,466

Half32,866.5

Square4,320,827,289

Cube284,020,940,187,837

Square root256.384476909≈irrational, shown to 9 decimal places

Cube root40.357831045≈

Negation-65,733

Reciprocal0.0000152131≈

Representations

Decimal65,733

Binary1000000001100010117 bits

Octal200305

Hexadecimal100C5

Base 361EPX

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

In wordssixty-five thousand, seven hundred and thirty-three

Ordinalsixty-five thousand, seven hundred and thirty-third

Scientific notation6.5733 × 10^4

Engineering notation65.733 × 10^3

In other bases

Ternary10100011120base 3; the most digit-efficient integer base after e: 11 digits

Quinary4100413base 5; one hand: 7 digits

Septenary362433base 7: 6 digits

Nonary110146base 9; each digit is two ternary digits: 6 digits

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

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

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

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

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

Bit-level

00000000000000010000000011000101

Bit length17 bitsto write the magnitude

Set bits5the population count, or Hamming weight

Zero bits12within that length

Bit parityodd5 set bits, so odd; not the same as the number itself being odd

Highest set bitbit 16worth 65,536

Lowest set bitbit 00 trailing zeros

Power of twoNo

Bytes301 00 c5

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

At each machine width

32-bit00000000000000010000000011000101

64-bit0000000000000000000000000000000000000000000000010000000011000101

One's complement11111111111111101111111100111010at 32 bits, every bit flipped

Bits reversed10100011000000001000000000000000at 32 bits

Rotated left by 100000000000000100000000110001010at 32 bits, wrapping

Shifted left by 1100000000110001010= 131,466, no wrap

Shifted right by 11000000001100010= 32,866, discarding the low bit

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

Nearest landmarks

Next prime65,761+28

Previous prime65,731−2

Distance to nearest prime2

Nearest square below65,536

Nearest square above66,049

Powers & multiples

65,733 to the power 24,320,827,289

65,733 to the power 3284,020,940,187,837

65,733 to the power 418,669,548,461,367,089,521

65,733 to the power 51,227,205,429,011,042,895,483,893

First ten multiples65,733, 131,466, 197,199, 262,932, 328,665, 394,398, 460,131, 525,864, 591,597, 657,330

Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

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 7No, remainder 3

Divisible by 8No, remainder 5

Divisible by 9No, remainder 6

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 1161the total stopping time

Highest value reached197,2003× the starting value

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

First steps65,733 → 197,200 → 98,600 → 49,300 → 24,650 → 12,325 → 36,976 → 18,488 → 9,244 → 4,622 → …

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

As a percentage & fraction

As a percentage6,573,300%

65,733% as a decimal657.33

65,733% of 10065,733

65,733% of 1,000657,330

As a fraction of 10065,733/100

Read another way

As seconds18 hours, 15 minutes and 33 seconds

As bytes64.192 KiB

As a 24-bit colour#0100C5

Keep nerding

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