Recognised as Number
60,800
- Positive
- Even
- Composite
- 5 digits
60,800 is an even 5-digit integer and a composite number. It has 48 divisors and a digital root of 5.
Number properties
ParityEvendivisible by 2
SignPositive
PrimalityComposite
Absolute value60,800
Digit count5
Digit sum14
Digit product0zero, because one of the digits is zero
Multiplicative persistence1times the digit product can be taken before one digit is left
Digital root5repeated digit sum
PalindromicNoreads differently backwards
Happy numberYessquared-digit sums reach 1
Harshad numberNodivisible by its own digit sum
Factors & divisors
Prime factorisation2^7 × 5^2 × 19
Distinct prime factors32, 5, 19
Number of divisors48
Sum of divisors σ(n)158,100
Aliquot sum97,300sum of the proper divisors
ClassificationAbundantthe aliquot sum exceeds the number
Euler's totient φ(n)23,040integers below n that share no factor with it
Carmichael function λ(n)1,440the smallest exponent with aˣ ≡ 1 for every unit; smaller than φ(n) = 23,040
Möbius function μ(n)0zero, because a prime divides n twice
SquarefreeNohas a repeated prime factor
All divisors1, 2, 4, 5, 8, 10, 16, 19, 20, 25, 32, 38, 40, 50, 64, 76, 80, 95, 100, 128, 152, 160, 190, 200, 304, 320, 380, 400, 475, 608, 640, 760, 800, 950, 1,216, 1,520, 1,600, 1,900, 2,432, 3,040, 3,200, 3,800, 6,080, 7,600, 12,160, 15,200, 30,400, 60,80048 in total
Arithmetic
Representations
Decimal60,800
Binary111011011000000016 bits
Octal166600
HexadecimalED80
Base 361AWW
Roman numeralNot defined above 3,999there is no agreed standard notation
In wordssixty thousand, eight hundred
Ordinalsixty thousand, eight hundredth
Scientific notation6.08 × 10^4
Engineering notation60.8 × 10^3
In other bases
Ternary10002101212base 3; the most digit-efficient integer base after e: 11 digits
Quinary3421200base 5; one hand: 7 digits
Septenary342155base 7: 6 digits
Nonary102355base 9; each digit is two ternary digits: 6 digits
Duodecimal2b228base 12; divides by 2, 3, 4 and 6, which is why eggs and inches come in twelves: 5 digits
Vigesimal7c00base 20; hands and feet, and the Mayan and Yoruba systems: 4 digits
Sexagesimal16:53:20base 60; Babylonian, and still how an hour and a circle are divided: 3 digits
Balanced ternary1001T11T0TTdigits −1, 0 and +1 written T, 0 and 1; negation is swapping T and 1, so no sign is needed
Negabinary10011001010000000base −2; place values alternate 1, −2, 4, −8, so every integer has exactly one form without a sign
Bit-level
1110110110000000
Bit length16 bitsto write the magnitude
Set bits7the population count, or Hamming weight
Zero bits9within that length
Bit parityodd7 set bits, so odd; not the same as the number itself being even
Highest set bitbit 15worth 32,768
Lowest set bitbit 77 trailing zeros
Power of twoNo
Bytes2ed 80
Gray code1001101101000000n XOR (n >> 1); successive values differ in exactly one bit
At each machine width
16-bit1110110110000000
32-bit00000000000000001110110110000000
64-bit0000000000000000000000000000000000000000000000001110110110000000
One's complement0001001001111111at 16 bits, every bit flipped
Bits reversed0000000110110111at 16 bits
Rotated left by 11101101100000001at 16 bits, wrapping
Shifted left by 111101101100000000= 121,600, no wrap
Shifted right by 1111011011000000= 30,400, discarding the low bit
These bits as a double3.00391913 × 10^-319≈IEEE-754 binary64 reinterpretation of the same 64 bits (subnormal)
Nearest landmarks
Powers & multiples
60,800 to the power 23,696,640,000
60,800 to the power 3224,755,712,000,000
60,800 to the power 413,665,147,289,600,000,000
60,800 to the power 5830,840,955,207,680,000,000,000
First ten multiples60,800, 121,600, 182,400, 243,200, 304,000, 364,800, 425,600, 486,400, 547,200, 608,000
Powers of twoBetween 2^15 (32,768) and 2^16 (65,536)
Divisibility tests
Divisible by 2Yes
Divisible by 3No, remainder 2
Divisible by 4Yes
Divisible by 5Yes
Divisible by 6No, remainder 2
Divisible by 7No, remainder 5
Divisible by 8Yes
Divisible by 9No, remainder 5
Divisible by 10Yes
Divisible by 11No, remainder 3
Divisible by 12No, remainder 8
Divisible by 100Yes
Collatz (3n + 1) trajectory
Steps to reach 134the total stopping time
Highest value reached60,800
Reaches 1Yesthe Collatz conjecture says every positive integer does, but it is unproven
First steps60,800 → 30,400 → 15,200 → 7,600 → 3,800 → 1,900 → 950 → 475 → 1,426 → 713 → …
Last steps… → 32 → 16 → 8 → 4 → 2 → 1
As a percentage & fraction
As a percentage6,080,000%
60,800% as a decimal608
60,800% of 10060,800
60,800% of 1,000608,000
As a fraction of 10060,800/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 60,800
Nerdulate something else
Nothing in mind? Surprise me · today’s page