Recognised as Number
68,080
- Positive
- Even
- Composite
- 5 digits
68,080 is an even 5-digit integer and a composite number. It has 40 divisors and a digital root of 4.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value68,080
Digit count5
Digit sum22
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^4 × 5 × 23 × 37
Distinct prime factors42, 5, 23, 37
Number of divisors40
Sum of divisors σ(n)169,632
Aliquot sum101,552sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)25,344integers below n that share no factor with it
Carmichael function λ(n)396the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 25,344
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 20, 23, 37, 40, 46, 74, 80, 92, 115, 148, 184, 185, 230, 296, 368, 370, 460, 592, 740, 851, 920, 1,480, 1,702, 1,840, 2,960, 3,404, 4,255, 6,808, 8,510, 13,616, 17,020, 34,040, 68,08040 in total
Arithmetic
Representations
Decimal68,080
Binary1000010011111000017 bits
Octal204760
Hexadecimal109F0
Base 361GJ4
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty-eight thousand and eighty
Ordinalsixty-eight thousand and eightieth
Scientific notation6.808 × 10^4
Engineering notation68.08 × 10^3
In other bases
Ternary10110101111base 3; the most digit-efficient integer base after e: 11 digits
Quinary4134310base 5; one hand: 7 digits
Septenary402325base 7: 6 digits
Nonary113344base 9; each digit is two ternary digits: 6 digits
Duodecimal33494base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal8a40base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal18:54:40base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary10110101111digits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10001111000110000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
00000000000000010000100111110000
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 44 trailing zeros
Power of twoNo
Bytes301 09 f0
Gray code11000110100001000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
32-bit00000000000000010000100111110000
64-bit0000000000000000000000000000000000000000000000010000100111110000
One's complement11111111111111101111011000001111at 32 bits, every bit flipped
Bits reversed00001111100100001000000000000000at 32 bits
Rotated left by 100000000000000100001001111100000at 32 bits, wrapping
Shifted left by 1100001001111100000= 136,160, no wrap
Shifted right by 11000010011111000= 34,040, discarding the low bit
These bits as a double3.36359892 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
68,080 to the power 24,634,886,400
68,080 to the power 3315,543,066,112,000
68,080 to the power 421,482,171,940,904,960,000
68,080 to the power 51,462,506,265,736,809,676,800,000
First ten multiples68,080, 136,160, 204,240, 272,320, 340,400, 408,480, 476,560, 544,640, 612,720, 680,800
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 5
Divisible by 8Yes
Divisible by 9No, remainder 4
Divisible by 10Yes
Divisible by 11No, remainder 1
Divisible by 12No, remainder 4
Divisible by 100No, remainder 80
Collatz (3n + 1) trajectory
Steps to reach 1205the total stopping time
Highest value reached6,810,136100× the starting value
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps68,080 → 34,040 → 17,020 → 8,510 → 4,255 → 12,766 → 6,383 → 19,150 → 9,575 → 28,726 → …
Last steps… → 5 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,808,000%
68,080% as a decimal680.8
68,080% of 10068,080
68,080% of 1,000680,800
As a fraction of 10068,080/100
Read another way
Keep nerding
Every link below is a page Nerdulator can generate from what it already knows about this value.
Derived from 68,080
Nerdulate something else
Nothing in mind? Surprise me · today’s page