Recognised as Number

66,536

Positive
Even
Composite
5 digits

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

Number properties

ParityEvendivisible by 2

SignPositive

PrimalityComposite

Absolute value66,536

Digit count5

Digit sum26

Digit product3,240

Multiplicative persistence2times 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 factorisation2^3 × 8,317

Distinct prime factors22, 8,317

Number of divisors8

Sum of divisors σ(n)124,770

Aliquot sum58,234sum 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)8,316the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 33,264

Möbius function μ(n)0zero, because a prime divides n twice

SquarefreeNohas a repeated prime factor

All divisors1, 2, 4, 8, 8,317, 16,634, 33,268, 66,5368 in total

Arithmetic

Previous number66,535

Next number66,537

Double133,072

Half33,268

Square4,427,039,296

Cube294,557,486,598,656

Square root257.945730726≈irrational, shown to 9 decimal places

Cube root40.521504609≈

Negation-66,536

Reciprocal0.0000150295≈

Representations

Decimal66,536

Binary1000000111110100017 bits

Octal201750

Hexadecimal103E8

Base 361FC8

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

In wordssixty-six thousand, five hundred and thirty-six

Ordinalsixty-six thousand, five hundred and thirty-sixth

Scientific notation6.6536 × 10^4

Engineering notation66.536 × 10^3

In other bases

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

Quinary4112121base 5; one hand: 7 digits

Septenary364661base 7: 6 digits

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

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

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

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

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

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

Bit-level

00000000000000010000001111101000

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 even

Highest set bitbit 16worth 65,536

Lowest set bitbit 33 trailing zeros

Power of twoNo

Bytes301 03 e8

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

At each machine width

32-bit00000000000000010000001111101000

64-bit0000000000000000000000000000000000000000000000010000001111101000

One's complement11111111111111101111110000010111at 32 bits, every bit flipped

Bits reversed00010111110000001000000000000000at 32 bits

Rotated left by 100000000000000100000011111010000at 32 bits, wrapping

Shifted left by 1100000011111010000= 133,072, no wrap

Shifted right by 11000000111110100= 33,268, discarding the low bit

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

Nearest landmarks

Next prime66,541+5

Previous prime66,533−3

Distance to nearest prime3

Nearest square below66,049

Nearest square above66,564

Powers & multiples

66,536 to the power 24,427,039,296

66,536 to the power 3294,557,486,598,656

66,536 to the power 419,598,676,928,328,175,616

66,536 to the power 51,304,017,568,103,243,492,786,176

First ten multiples66,536, 133,072, 199,608, 266,144, 332,680, 399,216, 465,752, 532,288, 598,824, 665,360

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

Divisibility tests

Divisible by 2Yes

Divisible by 3No, remainder 2

Divisible by 4Yes

Divisible by 5No, remainder 1

Divisible by 6No, remainder 2

Divisible by 7No, remainder 1

Divisible by 8Yes

Divisible by 9No, remainder 8

Divisible by 10No, remainder 6

Divisible by 11No, remainder 8

Divisible by 12No, remainder 8

Divisible by 100No, remainder 36

Collatz (3n + 1) trajectory

Steps to reach 155the total stopping time

Highest value reached66,536

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

First steps66,536 → 33,268 → 16,634 → 8,317 → 24,952 → 12,476 → 6,238 → 3,119 → 9,358 → 4,679 → …

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

As a percentage & fraction

As a percentage6,653,600%

66,536% as a decimal665.36

66,536% of 10066,536

66,536% of 1,000665,360

As a fraction of 10066,536/100

Read another way

As seconds18 hours, 28 minutes and 56 seconds

As bytes64.977 KiB

As a 24-bit colour#0103E8

Keep nerding

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