WordGPT

The number 30801

30801 is a composite number with 4 divisors. Its prime factorisation is 3 × 10267. Divisors (4): 1, 3, 10267, 30801.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 30801: a semiprime: 3 × 10267, the product of two primes.

  2. 2

    30801 is composite. Its prime factorisation is

    30801=3×1026730801 = 3 \times 10267
  3. 3

    The divisors add up to 41072; without 30801 itself that is 10271, so 30801 is deficient (10271 is less than 30801). Euler's totient φ(30801) = 20532 numbers up to 30801 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 30801 = 3 \times 10267 \]

30801 at a glance

PropertyValue
Typecomposite
Number of divisors4
Sum of divisors41072
Euler totient φ(n)20532
Square948701601
Cube29220958012401
Square root175.502137
Digit sum / digital root12 / 3
Collatz steps to 1134
Scientific notation3.0801 × 10410^{4}

30801 in other forms

FormValue
In wordsthirty thousand eight hundred and one
Binary (base 2)111100001010001
Octal (base 8)74121
Hexadecimal (base 16)7851
Base 31120020210
As time30801 seconds = 8 h 33 min 21 s

Is 30801 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).
3Yes (30801 ÷ 3 = 10267)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 3)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 3)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 1)A number is divisible by 11 if the alternating sum of the digits is a multiple of 11.
12No (remainder 9)A number is divisible by 12 if it is divisible by both 3 and 4.

Questions

Is 30801 a prime number?

No. 30801 = 3 × 10267, so it is divisible by 3.

What are the factors of 30801?

1, 3, 10267, 30801.

What is 30801 in binary?

111100001010001 (hexadecimal 7851, octal 74121).

What is the square root of 30801?

About 175.5021.

Is 30801 divisible by 3?

Yes. Its digits add up to 12, a multiple of 3.

What is special about the number 30801?

30801 is a semiprime: 3 × 10267, the product of two primes.

Find the next one

Nearby numbers

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