Recognised as Number

66,993

Positive
Odd
Composite
5 digits

66,993 is an odd 5-digit integer and a composite number. It has 8 divisors and a digital root of 6.

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value66,993

Digit count5

Digit sum33

Digit product8,748

Multiplicative persistence5times 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 × 137 × 163

Distinct prime factors33, 137, 163

Number of divisors8

Sum of divisors σ(n)90,528

Aliquot sum23,535sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)11,016the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 44,064

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

SquarefreeYesno repeated prime factor

All divisors1, 3, 137, 163, 411, 489, 22,331, 66,9938 in total

Arithmetic

Previous number66,992

Next number66,994

Double133,986

Half33,496.5

Square4,488,062,049

Cube300,668,740,848,657

Square root258.830060078≈irrational, shown to 9 decimal places

Cube root40.614066486≈

Negation-66,993

Reciprocal0.0000149269≈

Representations

Decimal66,993

Binary1000001011011000117 bits

Octal202661

Hexadecimal105B1

Base 361FOX

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

In wordssixty-six thousand, nine hundred and ninety-three

Ordinalsixty-six thousand, nine hundred and ninety-third

Scientific notation6.6993 × 10^4

Engineering notation66.993 × 10^3

In other bases

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

Quinary4120433base 5; one hand: 7 digits

Septenary366213base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000010110110001

Bit length17 bitsto write the magnitude

Set bits7the population count, or Hamming weight

Zero bits10within that length

Bit parityodd7 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 05 b1

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

At each machine width

32-bit00000000000000010000010110110001

64-bit0000000000000000000000000000000000000000000000010000010110110001

One's complement11111111111111101111101001001110at 32 bits, every bit flipped

Bits reversed10001101101000001000000000000000at 32 bits

Rotated left by 100000000000000100000101101100010at 32 bits, wrapping

Shifted left by 1100000101101100010= 133,986, no wrap

Shifted right by 11000001011011000= 33,496, discarding the low bit

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

Nearest landmarks

Next prime67,003+10

Previous prime66,977−16

Distance to nearest prime10

Nearest square below66,564

Nearest square above67,081

Powers & multiples

66,993 to the power 24,488,062,049

66,993 to the power 3300,668,740,848,657

66,993 to the power 420,142,700,955,674,078,401

66,993 to the power 51,349,419,965,123,473,534,318,193

First ten multiples66,993, 133,986, 200,979, 267,972, 334,965, 401,958, 468,951, 535,944, 602,937, 669,930

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 1

Divisible by 9No, remainder 6

Divisible by 10No, remainder 3

Divisible by 11No, remainder 3

Divisible by 12No, remainder 9

Divisible by 100No, remainder 93

Collatz (3n + 1) trajectory

Steps to reach 142the total stopping time

Highest value reached200,9803× the starting value

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

First steps66,993 → 200,980 → 100,490 → 50,245 → 150,736 → 75,368 → 37,684 → 18,842 → 9,421 → 28,264 → …

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

As a percentage & fraction

As a percentage6,699,300%

66,993% as a decimal669.93

66,993% of 10066,993

66,993% of 1,000669,930

As a fraction of 10066,993/100

Read another way

As seconds18 hours, 36 minutes and 33 seconds

As bytes65.423 KiB

As a 24-bit colour#0105B1

Keep nerding

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