Nerdulator> put something in

Recognised as Number

66,100

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value66,100
Digit count5
Digit sum13
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times 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 numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2^2 × 5^2 × 661
Distinct prime factors32, 5, 661
Number of divisors18
Sum of divisors σ(n)143,654
Aliquot sum77,554sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)26,400integers below n that share no factor with it
Carmichael function λ(n)660the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 26,400
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 10, 20, 25, 50, 100, 661, 1,322, 2,644, 3,305, 6,610, 13,220, 16,525, 33,050, 66,10018 in total

Arithmetic

Previous number66,099
Next number66,101
Double132,200
Half33,050
Square root257.099202644≈irrational, shown to 9 decimal places
Cube root40.43280021≈
Negation-66,100
Reciprocal0.0000151286≈

Representations

Decimal66,100
Binary1000000100011010017 bits
Octal201064
Hexadecimal10234
Base 361F04
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-six thousand, one hundred
Ordinalsixty-six thousand, one hundredth
Scientific notation6.61 × 10^4
Engineering notation66.1 × 10^3

In other bases

Ternary10100200011base 3; the most digit-efficient integer base after e: 11 digits
Quinary4103400base 5; one hand: 7 digits
Septenary363466base 7: 6 digits
Nonary110604base 9; each digit is two ternary digits: 6 digits
Duodecimal32304base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8550base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:21:40base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10101T00011digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10000011001110100base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010000001000110100
Bit length17 bitsto write the magnitude
Set bits5the population count, or Hamming weight
Zero bits12within that length
Bit parityodd5 set bits, so odd; 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 02 34
Gray code11000001100101110n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000001000110100
64-bit0000000000000000000000000000000000000000000000010000001000110100
One's complement11111111111111101111110111001011at 32 bits, every bit flipped
Bits reversed00101100010000001000000000000000at 32 bits
Rotated left by 100000000000000100000010001101000at 32 bits, wrapping
Shifted left by 1100000010001101000= 132,200, no wrap
Shifted right by 11000000100011010= 33,050, discarding the low bit
These bits as a double3.26577392 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime66,103+3
Previous prime66,089−11
Distance to nearest prime3
Nearest square below66,049
Nearest square above66,564

Powers & multiples

66,100 to the power 24,369,210,000
66,100 to the power 3288,804,781,000,000
66,100 to the power 419,089,996,024,100,000,000
66,100 to the power 51,261,848,737,193,010,000,000,000
First ten multiples66,100, 132,200, 198,300, 264,400, 330,500, 396,600, 462,700, 528,800, 594,900, 661,000
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

Divisible by 2Yes
Divisible by 3No, remainder 1
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 4
Divisible by 7No, remainder 6
Divisible by 8No, remainder 4
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100Yes

Collatz (3n + 1) trajectory

Steps to reach 1130the total stopping time
Highest value reached66,100
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps66,100 → 33,050 → 16,525 → 49,576 → 24,788 → 12,394 → 6,197 → 18,592 → 9,296 → 4,648 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,610,000%
66,100% as a decimal661
66,100% of 10066,100
66,100% of 1,000661,000
As a fraction of 10066,100/100

Read another way

As bytes64.551 KiB
As a 24-bit colour#010234

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