Nerdulator> put something in

Recognised as Number

66,717

  • Positive
  • Odd
  • Composite
  • 5 digits

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

Number properties

ParityOddnot divisible by 2
SignPositive
PrimalityComposite
Absolute value66,717
Digit count5
Digit sum27
Digit product1,764
Multiplicative persistence5times the digit product can be taken before one digit is left
Digital root9repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberYesdivisible by its own digit sum

Factors & divisors

Prime factorisation3^3 × 7 × 353
Distinct prime factors33, 7, 353
Number of divisors16
Sum of divisors σ(n)113,280
Aliquot sum46,563sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)38,016integers below n that share no factor with it
Carmichael function λ(n)3,168the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 38,016
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 3, 7, 9, 21, 27, 63, 189, 353, 1,059, 2,471, 3,177, 7,413, 9,531, 22,239, 66,71716 in total

Arithmetic

Previous number66,716
Next number66,718
Double133,434
Square root258.296341438≈irrational, shown to 9 decimal places
Cube root40.55821532≈
Negation-66,717
Reciprocal0.0000149887≈

Representations

Decimal66,717
Binary1000001001001110117 bits
Octal202235
Hexadecimal1049D
Base 361FH9
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, seven hundred and seventeen
Ordinalsixty-six thousand, seven hundred and seventeenth
Scientific notation6.6717 × 10^4
Engineering notation66.717 × 10^3

In other bases

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

Bit-level

00000000000000010000010010011101
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 04 9d
Gray code11000011011010011n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000010010011101
64-bit0000000000000000000000000000000000000000000000010000010010011101
One's complement11111111111111101111101101100010at 32 bits, every bit flipped
Bits reversed10111001001000001000000000000000at 32 bits
Rotated left by 100000000000000100000100100111010at 32 bits, wrapping
Shifted left by 1100000100100111010= 133,434, no wrap
Shifted right by 11000001001001110= 33,358, discarding the low bit
These bits as a double3.29625777 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime66,721+4
Previous prime66,713−4
Distance to nearest prime4
Nearest square below66,564
Nearest square above67,081

Powers & multiples

66,717 to the power 24,451,158,089
66,717 to the power 3296,967,914,223,813
66,717 to the power 419,812,808,333,270,131,921
66,717 to the power 51,321,851,133,570,783,391,373,357
First ten multiples66,717, 133,434, 200,151, 266,868, 333,585, 400,302, 467,019, 533,736, 600,453, 667,170
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 2
Divisible by 6No, remainder 3
Divisible by 7Yes
Divisible by 8No, remainder 5
Divisible by 9Yes
Divisible by 10No, remainder 7
Divisible by 11No, remainder 2
Divisible by 12No, remainder 9
Divisible by 100No, remainder 17

Collatz (3n + 1) trajectory

Steps to reach 1161the total stopping time
Highest value reached200,1523× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,717 → 200,152 → 100,076 → 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,700%
66,717% as a decimal667.17
66,717% of 10066,717
66,717% of 1,000667,170
As a fraction of 10066,717/100

Read another way

As bytes65.153 KiB
As a 24-bit colour#01049D

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 “66717” by Nerdulator’s number engine. Nothing here was retrieved from a database of answers or written by a model.