WordGPT

The number 30802

30802 is a composite number with 4 divisors. Its prime factorisation is 2 × 15401. Divisors (4): 1, 2, 15401, 30802.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 30802: a semiprime: 2 × 15401, the product of two primes.

  2. 2

    30802 is composite. Its prime factorisation is

    30802=2×1540130802 = 2 \times 15401
  3. 3

    The divisors add up to 46206; without 30802 itself that is 15404, so 30802 is deficient (15404 is less than 30802). Euler's totient φ(30802) = 15400 numbers up to 30802 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 30802 = 2 \times 15401 \]

30802 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors46206
Euler totient φ(n)15400
Square948763204
Cube29223804209608
Square root175.504986
Digit sum / digital root13 / 4
Collatz steps to 1147
Scientific notation3.0802 × 10410^{4}

30802 in other forms

FormValue
In wordsthirty thousand eight hundred and two
Binary (base 2)111100001010010
Octal (base 8)74122
Hexadecimal (base 16)7852
Base 31120020211
As time30802 seconds = 8 h 33 min 22 s

Is 30802 divisible by 2 to 12?

DivisorAnswerRule
2Yes (30802 ÷ 2 = 15401)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.
5No (remainder 2)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 4)A number is divisible by 9 if the digits add up to a multiple of 9.
10No (remainder 2)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 30802 a prime number?

No. 30802 = 2 × 15401, so it is divisible by 2.

What are the factors of 30802?

1, 2, 15401, 30802.

What is 30802 in binary?

111100001010010 (hexadecimal 7852, octal 74122).

What is the square root of 30802?

About 175.5050.

Is 30802 divisible by 3?

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

What is special about the number 30802?

30802 is a semiprime: 2 × 15401, the product of two primes.

Find the next one

Nearby numbers

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