WordGPT

The number 60213

60213 is a composite number with 4 divisors. Its prime factorisation is 3 × 20071. Divisors (4): 1, 3, 20071, 60213.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 60213: a semiprime: 3 × 20071, the product of two primes.

  2. 2

    60213 is composite. Its prime factorisation is

    60213=3×2007160213 = 3 \times 20071
  3. 3

    The divisors add up to 80288; without 60213 itself that is 20075, so 60213 is deficient (20075 is less than 60213). Euler's totient φ(60213) = 40140 numbers up to 60213 share no factor with it.

  4. 4

    The digits of 60213 add up to 12, and repeating that until one digit is left gives the digital root 3. The Collatz sequence (halve if even, else 3n+1) takes 42 steps to reach 1.

LaTeX source of the formulas on this page
\[ 60213 = 3 \times 20071 \]

60213 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors80288
Euler totient φ(n)40140
Square3625605369
Cube218308576083597
Square root245.383374
Digit sum / digital root12 / 3
Collatz steps to 142
Scientific notation6.0213 × 10410^{4}

60213 in other forms

FormValue
In wordssixty thousand two hundred and thirteen
Binary (base 2)1110101100110101
Octal (base 8)165465
Hexadecimal (base 16)EB35
Base 310001121010
As time60213 seconds = 16 h 43 min 33 s

Is 60213 divisible by 2 to 12?

DivisorAnswerRule
2No (remainder 1)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3Yes (60213 ÷ 3 = 20071)A number is divisible by 3 if the digits add up to a multiple of 3.
4No (remainder 1)A number is divisible by 4 if the last two digits make a multiple of 4.
5No (remainder 3)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 3)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 6)A number is divisible by 7 if double the last digit and subtract it from the rest: the result is a multiple of 7.
8No (remainder 5)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 3)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 3)A number is divisible by 10 if the last digit is 0.
11No (remainder 10)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 9)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 60213 a prime number?

No. 60213 = 3 × 20071, so it is divisible by 3.

What are the factors of 60213?

1, 3, 20071, 60213.

What is 60213 in binary?

1110101100110101 (hexadecimal EB35, octal 165465).

What is the square root of 60213?

About 245.3834.

Is 60213 divisible by 3?

Yes. Its digits add up to 12, a multiple of 3.

What is special about the number 60213?

60213 is a semiprime: 3 × 20071, the product of two primes.

Find the next one

Nearby numbers

    60213: is it prime? Factors, square root, binary, Roman numeral | WordGPT