WordGPT

The number 5301

5301 is a composite number with 12 divisors. Its prime factorisation is 323^{2} × 19 × 31. Divisors (12): 1, 3, 9, 19, 31, 57, 93, 171, 279, 589, 1767, 5301.

Number

Pick any whole number from 1 to 100,000.

How to work it out

  1. 1

    What is special about 5301: a Harshad number: divisible by its digit sum 9.

  2. 2

    5301 is composite. Its prime factorisation is

    5301=32×19×315301 = 3^{2} \times 19 \times 31
  3. 3

    The divisors add up to 8320; without 5301 itself that is 3019, so 5301 is deficient (3019 is less than 5301). Euler's totient φ(5301) = 3240 numbers up to 5301 share no factor with it.

  4. 4

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

LaTeX source of the formulas on this page
\[ 5301 = 3^{2} \times 19 \times 31 \]

5301 at a glance

PropertyValue
Typecomposite
Number of divisors12
Sum of divisors8320
Euler totient φ(n)3240
Square28100601
Cube148961285901
Square root72.807967 (= 3√589)
Digit sum / digital root9 / 9
Collatz steps to 128
Scientific notation5.301 × 10310^{3}

5301 in other forms

FormValue
In wordsfive thousand three hundred and one
Binary (base 2)1010010110101
Octal (base 8)12265
Hexadecimal (base 16)14B5
Base 321021100
As time5301 seconds = 1 h 28 min 21 s

Is 5301 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 (5301 ÷ 3 = 1767)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 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 5)A number is divisible by 8 if the last three digits make a multiple of 8.
9Yes (5301 ÷ 9 = 589)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 10)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 5301 a prime number?

No. 5301 = 323^{2} × 19 × 31, so it is divisible by 3.

What are the factors of 5301?

1, 3, 9, 19, 31, 57, 93, 171, 279, 589, 1767, 5301.

What is 5301 in binary?

1010010110101 (hexadecimal 14B5, octal 12265).

What is the square root of 5301?

About 72.8080, exactly 3√589.

Is 5301 divisible by 3?

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

What is special about the number 5301?

5301 is a Harshad number: divisible by its digit sum 9.

All about 5301

Find the next one

Nearby numbers

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