WordGPT

The number 60481

60481 is a composite number with 4 divisors. Its prime factorisation is 31 × 1951. Divisors (4): 1, 31, 1951, 60481.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 60481: a semiprime: 31 × 1951, the product of two primes.

  2. 2

    60481 is composite. Its prime factorisation is

    60481=31×195160481 = 31 \times 1951
  3. 3

    The divisors add up to 62464; without 60481 itself that is 1983, so 60481 is deficient (1983 is less than 60481). Euler's totient φ(60481) = 58500 numbers up to 60481 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 60481 = 31 \times 1951 \]

60481 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors62464
Euler totient φ(n)58500
Square3657951361
Cube221236556264641
Square root245.928851
Digit sum / digital root19 / 1
Collatz steps to 191
Scientific notation6.0481 × 10410^{4}

60481 in other forms

FormValue
In wordssixty thousand four hundred and eighty-one
Binary (base 2)1110110001000001
Octal (base 8)166101
Hexadecimal (base 16)EC41
Base 310001222001
As time60481 seconds = 16 h 48 min 1 s

Is 60481 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 1)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 1)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 1)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 3)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 60481 a prime number?

No. 60481 = 31 × 1951, so it is divisible by 31.

What are the factors of 60481?

1, 31, 1951, 60481.

What is 60481 in binary?

1110110001000001 (hexadecimal EC41, octal 166101).

What is the square root of 60481?

About 245.9289.

Is 60481 divisible by 3?

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

What is special about the number 60481?

60481 is a semiprime: 31 × 1951, the product of two primes.

Find the next one

Nearby numbers

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