Recognised as Number

66,991

Positive
Odd
Composite
5 digits

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

Number properties

ParityOddnot divisible by 2

SignPositive

PrimalityComposite

Absolute value66,991

Digit count5

Digit sum31

Digit product2,916

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

Digital root4repeated digit sum

PalindromicNoreads differently backwards

Happy numberNosquared-digit sums reach 1

Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation31 × 2,161

Distinct prime factors231, 2,161

Number of divisors4

Sum of divisors σ(n)69,184

Aliquot sum2,193sum of the proper divisors

ClassificationDeficientthe aliquot sum is less than the number

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

Carmichael function λ(n)2,160the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 64,800

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

SquarefreeYesno repeated prime factor

All divisors1, 31, 2,161, 66,9914 in total

Arithmetic

Previous number66,990

Next number66,992

Double133,982

Half33,495.5

Square4,487,794,081

Cube300,641,813,280,271

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

Cube root40.613662319≈

Negation-66,991

Reciprocal0.0000149274≈

Representations

Decimal66,991

Binary1000001011010111117 bits

Octal202657

Hexadecimal105AF

Base 361FOV

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

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

Ordinalsixty-six thousand, nine hundred and ninety-first

Scientific notation6.6991 × 10^4

Engineering notation66.991 × 10^3

In other bases

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

Quinary4120431base 5; one hand: 7 digits

Septenary366211base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000010110101111

Bit length17 bitsto write the magnitude

Set bits9the population count, or Hamming weight

Zero bits8within that length

Bit parityodd9 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 af

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

At each machine width

32-bit00000000000000010000010110101111

64-bit0000000000000000000000000000000000000000000000010000010110101111

One's complement11111111111111101111101001010000at 32 bits, every bit flipped

Bits reversed11110101101000001000000000000000at 32 bits

Rotated left by 100000000000000100000101101011110at 32 bits, wrapping

Shifted left by 1100000101101011110= 133,982, no wrap

Shifted right by 11000001011010111= 33,495, discarding the low bit

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

Nearest landmarks

Next prime67,003+12

Previous prime66,977−14

Distance to nearest prime12

Nearest square below66,564

Nearest square above67,081

Powers & multiples

66,991 to the power 24,487,794,081

66,991 to the power 3300,641,813,280,271

66,991 to the power 420,140,295,713,458,634,561

66,991 to the power 51,349,218,550,140,307,387,875,951

First ten multiples66,991, 133,982, 200,973, 267,964, 334,955, 401,946, 468,937, 535,928, 602,919, 669,910

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

Divisibility tests

Divisible by 2No, remainder 1

Divisible by 3No, remainder 1

Divisible by 4No, remainder 3

Divisible by 5No, remainder 1

Divisible by 6No, remainder 1

Divisible by 7No, remainder 1

Divisible by 8No, remainder 7

Divisible by 9No, remainder 4

Divisible by 10No, remainder 1

Divisible by 11No, remainder 1

Divisible by 12No, remainder 7

Divisible by 100No, remainder 91

Collatz (3n + 1) trajectory

Steps to reach 168the total stopping time

Highest value reached678,29210× the starting value

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

First steps66,991 → 200,974 → 100,487 → 301,462 → 150,731 → 452,194 → 226,097 → 678,292 → 339,146 → 169,573 → …

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

As a percentage & fraction

As a percentage6,699,100%

66,991% as a decimal669.91

66,991% of 10066,991

66,991% of 1,000669,910

As a fraction of 10066,991/100

Read another way

As seconds18 hours, 36 minutes and 31 seconds

As bytes65.421 KiB

As a 24-bit colour#0105AF

Keep nerding

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