WordGPT

The number 64501

64501 is a composite number with 4 divisors. Its prime factorisation is 53 × 1217. Divisors (4): 1, 53, 1217, 64501.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 64501: a semiprime: 53 × 1217, the product of two primes.

  2. 2

    64501 is composite. Its prime factorisation is

    64501=53×121764501 = 53 \times 1217
  3. 3

    The divisors add up to 65772; without 64501 itself that is 1271, so 64501 is deficient (1271 is less than 64501). Euler's totient φ(64501) = 63232 numbers up to 64501 share no factor with it.

  4. 4

    The digits of 64501 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 99 steps to reach 1.

LaTeX source of the formulas on this page
\[ 64501 = 53 \times 1217 \]

64501 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors65772
Euler totient φ(n)63232
Square4160379001
Cube268348605943501
Square root253.970471
Digit sum / digital root16 / 7
Collatz steps to 199
Scientific notation6.4501 × 10410^{4}

64501 in other forms

FormValue
In wordssixty-four thousand five hundred and one
Binary (base 2)1111101111110101
Octal (base 8)175765
Hexadecimal (base 16)FBF5
Base 310021110221
As time64501 seconds = 17 h 55 min 1 s

Is 64501 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 1)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 3)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 1)A number is divisible by 10 if the last digit is 0.
11No (remainder 8)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 64501 a prime number?

No. 64501 = 53 × 1217, so it is divisible by 53.

What are the factors of 64501?

1, 53, 1217, 64501.

What is 64501 in binary?

1111101111110101 (hexadecimal FBF5, octal 175765).

What is the square root of 64501?

About 253.9705.

Is 64501 divisible by 3?

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

What is special about the number 64501?

64501 is a semiprime: 53 × 1217, the product of two primes.

Find the next one

Nearby numbers

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