WordGPT

The number 47930

47930 is a composite number with 8 divisors. Its prime factorisation is 2 × 5 × 4793. Divisors (8): 1, 2, 5, 10, 4793, 9586, 23965, 47930.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    47930 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

    47930 is composite. Its prime factorisation is

    47930=2×5×479347930 = 2 \times 5 \times 4793
  3. 3

    The divisors add up to 86292; without 47930 itself that is 38362, so 47930 is deficient (38362 is less than 47930). Euler's totient φ(47930) = 19168 numbers up to 47930 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 47930 = 2 \times 5 \times 4793 \]

47930 at a glance

PropertyValue
Typecomposite
Number of divisors8
Sum of divisors86292
Euler totient φ(n)19168
Square2297284900
Cube110108865257000
Square root218.929212
Digit sum / digital root23 / 5
Collatz steps to 196
Scientific notation4.793 × 10410^{4}

47930 in other forms

FormValue
In wordsforty-seven thousand nine hundred and thirty
Binary (base 2)1011101100111010
Octal (base 8)135472
Hexadecimal (base 16)BB3A
Base 32102202012
As time47930 seconds = 13 h 18 min 50 s

Is 47930 divisible by 2 to 12?

DivisorAnswerRule
2Yes (47930 ÷ 2 = 23965)A number is divisible by 2 if the last digit is even (0, 2, 4, 6, 8).
3No (remainder 2)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 (47930 ÷ 5 = 9586)A number is divisible by 5 if the last digit is 0 or 5.
6No (remainder 2)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 2)A number is divisible by 8 if the last three digits make a multiple of 8.
9No (remainder 5)A number is divisible by 9 if the digits add up to a multiple of 9.
10Yes (47930 ÷ 10 = 4793)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 2)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 47930 a prime number?

No. 47930 = 2 × 5 × 4793, so it is divisible by 2.

What are the factors of 47930?

1, 2, 5, 10, 4793, 9586, 23965, 47930.

What is 47930 in binary?

1011101100111010 (hexadecimal BB3A, octal 135472).

What is the square root of 47930?

About 218.9292.

Is 47930 divisible by 3?

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

What is special about the number 47930?

It is a composite number with 8 divisors.

Find the next one

Nearby numbers

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