WordGPT

The number 4930

4930 is a composite number with 16 divisors. Its prime factorisation is 2 × 5 × 17 × 29. Divisors (16): 1, 2, 5, 10, 17, 29, 34, 58, 85, 145, 170, 290, 493, 986, 2465, 4930.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    4930 has no famous special property in the usual lists (prime, square, cube, triangular, Fibonacci, palindrome, perfect), but it is still a composite number.

  2. 2

    4930 is composite. Its prime factorisation is

    4930=2×5×17×294930 = 2 \times 5 \times 17 \times 29
  3. 3

    The divisors add up to 9720; without 4930 itself that is 4790, so 4930 is deficient (4790 is less than 4930). Euler's totient φ(4930) = 1792 numbers up to 4930 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 4930 = 2 \times 5 \times 17 \times 29 \]

4930 at a glance

PropertyValue
Typecomposite
Number of divisors16
Sum of divisors9720
Euler totient φ(n)1792
Square24304900
Cube119823157000
Square root70.213959
Digit sum / digital root16 / 7
Collatz steps to 172
Scientific notation4.93 × 10310^{3}

4930 in other forms

FormValue
In wordsfour thousand nine hundred and thirty
Binary (base 2)1001101000010
Octal (base 8)11502
Hexadecimal (base 16)1342
Base 320202121
As time4930 seconds = 1 h 22 min 10 s

Is 4930 divisible by 2 to 12?

DivisorAnswerRule
2Yes (4930 ÷ 2 = 2465)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 2)A number is divisible by 4 if the last two digits make a multiple of 4.
5Yes (4930 ÷ 5 = 986)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 4)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 2)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.
10Yes (4930 ÷ 10 = 493)A number is divisible by 10 if the last digit is 0.
11No (remainder 2)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 10)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 4930 a prime number?

No. 4930 = 2 × 5 × 17 × 29, so it is divisible by 2.

What are the factors of 4930?

1, 2, 5, 10, 17, 29, 34, 58, 85, 145, 170, 290, 493, 986, 2465, 4930.

What is 4930 in binary?

1001101000010 (hexadecimal 1342, octal 11502).

What is the square root of 4930?

About 70.2140.

Is 4930 divisible by 3?

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

What is special about the number 4930?

It is a composite number with 16 divisors.

All about 4930

Find the next one

Nearby numbers

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