WordGPT

The number 64213

64213 is a composite number with 4 divisors. Its prime factorisation is 157 × 409. Divisors (4): 1, 157, 409, 64213.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 64213: a semiprime: 157 × 409, the product of two primes.

  2. 2

    64213 is composite. Its prime factorisation is

    64213=157×40964213 = 157 \times 409
  3. 3

    The divisors add up to 64780; without 64213 itself that is 567, so 64213 is deficient (567 is less than 64213). Euler's totient φ(64213) = 63648 numbers up to 64213 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 64213 = 157 \times 409 \]

64213 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors64780
Euler totient φ(n)63648
Square4123309369
Cube264770064511597
Square root253.402841
Digit sum / digital root16 / 7
Collatz steps to 147
Scientific notation6.4213 × 10410^{4}

64213 in other forms

FormValue
In wordssixty-four thousand two hundred and thirteen
Binary (base 2)1111101011010101
Octal (base 8)175325
Hexadecimal (base 16)FAD5
Base 310021002021
As time64213 seconds = 17 h 50 min 13 s

Is 64213 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).
3No (remainder 1)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 1)A number is divisible by 6 if it is divisible by both 2 and 3.
7No (remainder 2)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 7)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 6)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 1)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 64213 a prime number?

No. 64213 = 157 × 409, so it is divisible by 157.

What are the factors of 64213?

1, 157, 409, 64213.

What is 64213 in binary?

1111101011010101 (hexadecimal FAD5, octal 175325).

What is the square root of 64213?

About 253.4028.

Is 64213 divisible by 3?

No. Its digits add up to 16, which is not a multiple of 3.

What is special about the number 64213?

64213 is a semiprime: 157 × 409, the product of two primes.

Find the next one

Nearby numbers

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