Nerdulator> put something in

Recognised as Number

67,610

  • Positive
  • Even
  • Composite
  • 5 digits

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

Number properties

ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value67,610
Digit count5
Digit sum20
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root2repeated digit sum
PalindromicNoreads differently backwards
Happy numberNosquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum

Factors & divisors

Prime factorisation2 × 5 × 6,761
Distinct prime factors32, 5, 6,761
Number of divisors8
Sum of divisors σ(n)121,716
Aliquot sum54,106sum of the proper divisors
ClassificationDeficientthe aliquot sum is less than the number
Euler's totient φ(n)27,040integers below n that share no factor with it
Carmichael function λ(n)6,760the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 27,040
Möbius function μ(n)−13 distinct prime factors, an odd number of them
SquarefreeYesno repeated prime factor
All divisors1, 2, 5, 10, 6,761, 13,522, 33,805, 67,6108 in total

Arithmetic

Previous number67,609
Next number67,611
Double135,220
Half33,805
Square root260.019230058≈irrational, shown to 9 decimal places
Cube root40.738369722≈
Negation-67,610
Reciprocal0.0000147907≈

Representations

Decimal67,610
Binary1000010000001101017 bits
Octal204032
Hexadecimal1081A
Base 361G62
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-seven thousand, six hundred and ten
Ordinalsixty-seven thousand, six hundred and tenth
Scientific notation6.761 × 10^4
Engineering notation67.61 × 10^3

In other bases

Ternary10102202002base 3; the most digit-efficient integer base after e: 11 digits
Quinary4130420base 5; one hand: 7 digits
Septenary401054base 7: 6 digits
Nonary112662base 9; each digit is two ternary digits: 6 digits
Duodecimal33162base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal890abase 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:46:50base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10110T1T01Tdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001100001101110base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign

Bit-level

00000000000000010000100000011010
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 11 trailing zero
Power of twoNo
Bytes301 08 1a
Gray code11000110000010111n XOR (n >> 1); successive values differ in exactly one bit

At each machine width

32-bit00000000000000010000100000011010
64-bit0000000000000000000000000000000000000000000000010000100000011010
One's complement11111111111111101111011111100101at 32 bits, every bit flipped
Bits reversed01011000000100001000000000000000at 32 bits
Rotated left by 100000000000000100001000000110100at 32 bits, wrapping
Shifted left by 1100001000000110100= 135,220, no wrap
Shifted right by 11000010000001101= 33,805, discarding the low bit
These bits as a double3.34037783 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)

Nearest landmarks

Next prime67,619+9
Previous prime67,607−3
Distance to nearest prime3
Nearest square below67,600
Nearest square above68,121

Powers & multiples

67,610 to the power 24,571,112,100
67,610 to the power 3309,052,889,081,000
67,610 to the power 420,895,065,830,766,410,000
67,610 to the power 51,412,715,400,818,116,980,100,000
First ten multiples67,610, 135,220, 202,830, 270,440, 338,050, 405,660, 473,270, 540,880, 608,490, 676,100
Powers of twoBetween 2^16 (65,536) and 2^17 (131,072)

Divisibility tests

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

Collatz (3n + 1) trajectory

Steps to reach 160the total stopping time
Highest value reached101,4161× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps67,610 → 33,805 → 101,416 → 50,708 → 25,354 → 12,677 → 38,032 → 19,016 → 9,508 → 4,754 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1

As a percentage & fraction

As a percentage6,761,000%
67,610% as a decimal676.1
67,610% of 10067,610
67,610% of 1,000676,100
As a fraction of 10067,610/100

Read another way

As bytes66.025 KiB
As a 24-bit colour#01081A

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