Nerdulator> put something in

Recognised as Number

66,716

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value66,716
Digit count5
Digit sum26
Digit product1,512
Multiplicative persistence3times 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 numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 13 × 1,283
Distinct prime factors32, 13, 1,283
Number of divisors12
Sum of divisors σ(n)125,832
Aliquot sum59,116sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)30,768integers below n that share no factor with it
Carmichael function λ(n)7,692the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 30,768
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 13, 26, 52, 1,283, 2,566, 5,132, 16,679, 33,358, 66,71612 in total

Arithmetic

Previous number66,715
Next number66,717
Double133,432
Half33,358
Square root258.294405669≈irrational, shown to 9 decimal places
Cube root40.558012681≈
Negation-66,716
Reciprocal0.0000149889≈

Representations

Decimal66,716
Binary1000001001001110017 bits
Octal202234
Hexadecimal1049C
Base 361FH8
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, seven hundred and sixteen
Ordinalsixty-six thousand, seven hundred and sixteenth
Scientific notation6.6716 × 10^4
Engineering notation66.716 × 10^3

In other bases

Ternary10101111222base 3; the most digit-efficient integer base after e: 11 digits
Quinary4113331base 5; one hand: 7 digits
Septenary365336base 7: 6 digits
Nonary111458base 9; each digit is two ternary digits: 6 digits
Duodecimal32738base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal86fgbase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:31:56base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1011TTTT00Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000010111101100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010000010010011100
Bit length17 bitsto write the magnitude
Set bits6the population count, or Hamming weight
Zero bits11within that length
Bit parityeven6 set bits, so even; not the same as the number itself being even
Highest set bitbit 16worth 65,536
Lowest set bitbit 22 trailing zeros
Power of twoNo
Bytes301 04 9c
Gray code11000011011010010n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000010010011100
64-bit0000000000000000000000000000000000000000000000010000010010011100
One's complement11111111111111101111101101100011at 32 bits, every bit flipped
Bits reversed00111001001000001000000000000000at 32 bits
Rotated left by 100000000000000100000100100111000at 32 bits, wrapping
Shifted left by 1100000100100111000= 133,432, no wrap
Shifted right by 11000001001001110= 33,358, discarding the low bit
These bits as a double3.29620836 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime66,721+5
Previous prime66,713−3
Distance to nearest prime3
Nearest square below66,564
Nearest square above67,081

Powers & multiples

66,716 to the power 24,451,024,656
66,716 to the power 3296,954,560,949,696
66,716 to the power 419,811,620,488,319,918,336
66,716 to the power 51,321,752,072,498,751,671,704,576
First ten multiples66,716, 133,432, 200,148, 266,864, 333,580, 400,296, 467,012, 533,728, 600,444, 667,160
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 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 8
Divisible by 10No, remainder 6
Divisible by 11No, remainder 1
Divisible by 12No, remainder 8
Divisible by 100No, remainder 16

Collatz (3n + 1) trajectory

Steps to reach 1161the total stopping time
Highest value reached126,6641× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,716 → 33,358 → 16,679 → 50,038 → 25,019 → 75,058 → 37,529 → 112,588 → 56,294 → 28,147 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,671,600%
66,716% as a decimal667.16
66,716% of 10066,716
66,716% of 1,000667,160
As a fraction of 10066,716/100

Read another way

As bytes65.152 KiB
As a 24-bit colour#01049C

Keep nerding

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

Nerdulate something else

Nothing in mind? Surprise me · today’s page

Every value on this page was computed from “66716” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.